/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-38.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:36:49,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:36:49,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:36:49,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:36:49,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:36:49,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:36:49,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:36:49,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:36:49,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:36:49,189 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:36:49,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:36:49,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:36:49,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:36:49,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:36:49,192 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:36:49,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:36:49,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:36:49,192 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:36:49,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:36:49,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:36:49,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:36:49,194 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:36:49,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:36:49,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:36:49,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:36:49,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:36:49,197 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:36:49,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:36:49,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:36:49,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:36:49,414 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:36:49,415 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:36:49,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-38.i [2023-12-21 02:36:50,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:36:50,570 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:36:50,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-38.i [2023-12-21 02:36:50,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ae8c435/02c02aa60dda475faf83cd3986a047f9/FLAGe431b7ae9 [2023-12-21 02:36:50,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ae8c435/02c02aa60dda475faf83cd3986a047f9 [2023-12-21 02:36:50,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:36:50,588 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:36:50,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:36:50,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:36:50,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:36:50,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:50,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c79b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50, skipping insertion in model container [2023-12-21 02:36:50,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:50,621 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:36:50,743 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-38.i[917,930] [2023-12-21 02:36:50,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:36:50,844 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:36:50,851 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-38.i[917,930] [2023-12-21 02:36:50,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:36:50,905 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:36:50,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50 WrapperNode [2023-12-21 02:36:50,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:36:50,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:36:50,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:36:50,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:36:50,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:50,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,008 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-21 02:36:51,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:36:51,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:36:51,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:36:51,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:36:51,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,046 INFO L175 MemorySlicer]: Split 141 memory accesses to 2 slices as follows [2, 139]. 99 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 19]. The 21 writes are split as follows [0, 21]. [2023-12-21 02:36:51,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:36:51,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:36:51,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:36:51,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:36:51,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (1/1) ... [2023-12-21 02:36:51,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:36:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:51,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:36:51,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:36:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:36:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:36:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:36:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:36:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:36:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:36:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:36:51,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:36:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:36:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:36:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:36:51,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:36:51,302 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:36:51,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:36:51,664 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:36:51,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:36:51,701 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:36:51,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:36:51 BoogieIcfgContainer [2023-12-21 02:36:51,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:36:51,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:36:51,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:36:51,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:36:51,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:36:50" (1/3) ... [2023-12-21 02:36:51,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec8e560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:36:51, skipping insertion in model container [2023-12-21 02:36:51,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:36:50" (2/3) ... [2023-12-21 02:36:51,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec8e560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:36:51, skipping insertion in model container [2023-12-21 02:36:51,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:36:51" (3/3) ... [2023-12-21 02:36:51,707 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-38.i [2023-12-21 02:36:51,718 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:36:51,718 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:36:51,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:36:51,760 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21e6565f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:36:51,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:36:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:36:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:36:51,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:51,783 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:51,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:51,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1437029608, now seen corresponding path program 1 times [2023-12-21 02:36:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:51,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46594928] [2023-12-21 02:36:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:51,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:36:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:36:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:36:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:36:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:36:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:36:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:36:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:36:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:36:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:36:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:36:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:36:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:36:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:36:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:36:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:36:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:36:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:36:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:36:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46594928] [2023-12-21 02:36:52,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46594928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:52,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:52,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:36:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729047754] [2023-12-21 02:36:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:52,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:36:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:36:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:36:52,320 INFO L87 Difference]: Start difference. First operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:36:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:52,357 INFO L93 Difference]: Finished difference Result 227 states and 366 transitions. [2023-12-21 02:36:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:36:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 02:36:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:52,364 INFO L225 Difference]: With dead ends: 227 [2023-12-21 02:36:52,364 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 02:36:52,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:36:52,369 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:52,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:36:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 02:36:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-21 02:36:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:36:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2023-12-21 02:36:52,416 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 179 [2023-12-21 02:36:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:52,417 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2023-12-21 02:36:52,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:36:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2023-12-21 02:36:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:36:52,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:52,421 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:36:52,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:52,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 559070352, now seen corresponding path program 1 times [2023-12-21 02:36:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006937086] [2023-12-21 02:36:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:36:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:36:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:36:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:36:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:36:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:36:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:36:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:36:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:36:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:36:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:36:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:36:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:36:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:36:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:36:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:36:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:36:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:36:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:36:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006937086] [2023-12-21 02:36:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006937086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:36:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878979629] [2023-12-21 02:36:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:53,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:53,539 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:36:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:53,843 INFO L93 Difference]: Finished difference Result 258 states and 381 transitions. [2023-12-21 02:36:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 179 [2023-12-21 02:36:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:53,849 INFO L225 Difference]: With dead ends: 258 [2023-12-21 02:36:53,849 INFO L226 Difference]: Without dead ends: 146 [2023-12-21 02:36:53,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:36:53,852 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 188 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:53,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 398 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-21 02:36:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2023-12-21 02:36:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:36:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2023-12-21 02:36:53,887 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 179 [2023-12-21 02:36:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:53,890 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2023-12-21 02:36:53,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:36:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2023-12-21 02:36:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:36:53,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:53,894 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:53,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:36:53,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:53,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1731910576, now seen corresponding path program 1 times [2023-12-21 02:36:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94681759] [2023-12-21 02:36:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:36:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:36:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:36:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:36:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:36:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:36:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:36:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:36:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:36:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:36:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:36:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:36:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:36:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:36:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:36:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:36:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:36:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:36:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:36:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:36:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:36:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:36:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:36:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:36:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:36:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94681759] [2023-12-21 02:36:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94681759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:57,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:36:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046848399] [2023-12-21 02:36:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:36:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:36:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:36:57,394 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:36:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:59,304 INFO L93 Difference]: Finished difference Result 295 states and 432 transitions. [2023-12-21 02:36:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:36:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 02:36:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:59,306 INFO L225 Difference]: With dead ends: 295 [2023-12-21 02:36:59,306 INFO L226 Difference]: Without dead ends: 180 [2023-12-21 02:36:59,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-12-21 02:36:59,307 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 354 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:59,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 598 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 02:36:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-21 02:36:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 133. [2023-12-21 02:36:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:36:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2023-12-21 02:36:59,323 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 179 [2023-12-21 02:36:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:59,323 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2023-12-21 02:36:59,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:36:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2023-12-21 02:36:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:36:59,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:59,325 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:59,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:36:59,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:59,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1473745138, now seen corresponding path program 1 times [2023-12-21 02:36:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470338054] [2023-12-21 02:36:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470338054] [2023-12-21 02:37:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470338054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:37:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272266952] [2023-12-21 02:37:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:01,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:37:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:37:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:37:01,157 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:37:03,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:37:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:37:03,657 INFO L93 Difference]: Finished difference Result 327 states and 477 transitions. [2023-12-21 02:37:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:37:03,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 179 [2023-12-21 02:37:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:37:03,659 INFO L225 Difference]: With dead ends: 327 [2023-12-21 02:37:03,659 INFO L226 Difference]: Without dead ends: 195 [2023-12-21 02:37:03,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:37:03,660 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 411 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:37:03,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 474 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-21 02:37:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-21 02:37:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2023-12-21 02:37:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:37:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2023-12-21 02:37:03,679 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 179 [2023-12-21 02:37:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:37:03,680 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2023-12-21 02:37:03,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:37:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2023-12-21 02:37:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:37:03,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:37:03,683 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:37:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:37:03,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:37:03,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:37:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 874112978, now seen corresponding path program 1 times [2023-12-21 02:37:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:37:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093436463] [2023-12-21 02:37:03,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:37:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:37:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093436463] [2023-12-21 02:37:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093436463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:05,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:05,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:37:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111763602] [2023-12-21 02:37:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:05,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:37:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:37:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:37:05,657 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:37:06,817 INFO L93 Difference]: Finished difference Result 318 states and 459 transitions. [2023-12-21 02:37:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:37:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 02:37:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:37:06,820 INFO L225 Difference]: With dead ends: 318 [2023-12-21 02:37:06,820 INFO L226 Difference]: Without dead ends: 173 [2023-12-21 02:37:06,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-21 02:37:06,821 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 353 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:37:06,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 637 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 02:37:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-21 02:37:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2023-12-21 02:37:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:37:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 193 transitions. [2023-12-21 02:37:06,842 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 193 transitions. Word has length 179 [2023-12-21 02:37:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:37:06,843 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 193 transitions. [2023-12-21 02:37:06,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 193 transitions. [2023-12-21 02:37:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:37:06,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:37:06,845 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:37:06,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:37:06,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:37:06,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:37:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1309208750, now seen corresponding path program 1 times [2023-12-21 02:37:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:37:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237232844] [2023-12-21 02:37:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:37:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:37:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237232844] [2023-12-21 02:37:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237232844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:08,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:08,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:37:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539481768] [2023-12-21 02:37:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:08,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:37:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:37:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:37:08,415 INFO L87 Difference]: Start difference. First operand 133 states and 193 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:37:09,122 INFO L93 Difference]: Finished difference Result 316 states and 459 transitions. [2023-12-21 02:37:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:37:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 02:37:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:37:09,124 INFO L225 Difference]: With dead ends: 316 [2023-12-21 02:37:09,124 INFO L226 Difference]: Without dead ends: 184 [2023-12-21 02:37:09,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:37:09,125 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 417 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:37:09,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 481 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:37:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-21 02:37:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 135. [2023-12-21 02:37:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:37:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2023-12-21 02:37:09,164 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 179 [2023-12-21 02:37:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:37:09,165 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2023-12-21 02:37:09,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2023-12-21 02:37:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 02:37:09,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:37:09,167 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:37:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:37:09,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:37:09,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:37:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1051043312, now seen corresponding path program 1 times [2023-12-21 02:37:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:37:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247537631] [2023-12-21 02:37:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:37:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:37:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247537631] [2023-12-21 02:37:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247537631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:37:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319478073] [2023-12-21 02:37:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:11,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:37:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:37:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:37:11,159 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:37:12,383 INFO L93 Difference]: Finished difference Result 296 states and 427 transitions. [2023-12-21 02:37:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:37:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 02:37:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:37:12,384 INFO L225 Difference]: With dead ends: 296 [2023-12-21 02:37:12,385 INFO L226 Difference]: Without dead ends: 162 [2023-12-21 02:37:12,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-21 02:37:12,386 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 348 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:37:12,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 594 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 02:37:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-21 02:37:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2023-12-21 02:37:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:37:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2023-12-21 02:37:12,398 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 179 [2023-12-21 02:37:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:37:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2023-12-21 02:37:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 02:37:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2023-12-21 02:37:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-21 02:37:12,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:37:12,400 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:37:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:37:12,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:37:12,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:37:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1031481254, now seen corresponding path program 1 times [2023-12-21 02:37:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:37:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200566012] [2023-12-21 02:37:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:37:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:37:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200566012] [2023-12-21 02:37:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200566012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:37:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463748437] [2023-12-21 02:37:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:12,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:37:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:37:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:37:12,557 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:37:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:37:12,622 INFO L93 Difference]: Finished difference Result 269 states and 389 transitions. [2023-12-21 02:37:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:37:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 180 [2023-12-21 02:37:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:37:12,623 INFO L225 Difference]: With dead ends: 269 [2023-12-21 02:37:12,624 INFO L226 Difference]: Without dead ends: 135 [2023-12-21 02:37:12,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:37:12,625 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:37:12,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:37:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-21 02:37:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-12-21 02:37:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:37:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2023-12-21 02:37:12,642 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 180 [2023-12-21 02:37:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:37:12,642 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2023-12-21 02:37:12,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 02:37:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2023-12-21 02:37:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-21 02:37:12,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:37:12,643 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:37:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:37:12,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:37:12,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:37:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1844987851, now seen corresponding path program 1 times [2023-12-21 02:37:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:37:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412271330] [2023-12-21 02:37:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:37:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:37:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:30,447 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:37:38,631 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 02:37:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:37:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:37:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:37:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:37:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:37:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:37:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:37:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:37:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:37:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:37:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:37:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:37:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:37:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:37:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:37:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:37:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 02:37:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 02:37:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:37:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:37:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:37:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 02:37:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 02:37:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 02:37:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:37:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 02:37:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:37:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412271330] [2023-12-21 02:37:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412271330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:37:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:37:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-21 02:37:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285285738] [2023-12-21 02:37:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:37:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 02:37:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:37:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 02:37:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:37:47,742 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-21 02:39:01,977 WARN L293 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 234 DAG size of output: 204 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:39:06,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:39:10,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:42:29,154 WARN L293 SmtUtils]: Spent 3.21m on a formula simplification. DAG size of input: 272 DAG size of output: 249 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:42:33,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:42:37,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:45:59,324 WARN L293 SmtUtils]: Spent 3.20m on a formula simplification. DAG size of input: 294 DAG size of output: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:46:03,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:46:07,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:46:11,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:46:15,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:46:19,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:46:23,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:48:17,242 WARN L293 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 297 DAG size of output: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:48:20,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:48:24,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-21 02:51:19,763 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:51:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:51:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 599.4s TimeCoverageRelationStatistics Valid=163, Invalid=704, Unknown=3, NotChecked=0, Total=870 [2023-12-21 02:51:20,858 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 163 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:51:20,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 562 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1313 Invalid, 10 Unknown, 0 Unchecked, 50.5s Time] [2023-12-21 02:51:20,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:51:20,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:51:20,860 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (135states) and FLOYD_HOARE automaton (currently 15 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 02:51:20,863 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:51:20,868 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:51:20,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:51:20 BoogieIcfgContainer [2023-12-21 02:51:20,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:51:20,870 INFO L158 Benchmark]: Toolchain (without parser) took 870282.28ms. Allocated memory was 200.3MB in the beginning and 895.5MB in the end (delta: 695.2MB). Free memory was 141.3MB in the beginning and 686.2MB in the end (delta: -544.9MB). Peak memory consumption was 150.6MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,871 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 200.3MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:51:20,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.09ms. Allocated memory is still 200.3MB. Free memory was 141.0MB in the beginning and 123.4MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.03ms. Allocated memory is still 200.3MB. Free memory was 123.4MB in the beginning and 167.3MB in the end (delta: -43.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,874 INFO L158 Benchmark]: Boogie Preprocessor took 73.65ms. Allocated memory is still 200.3MB. Free memory was 167.3MB in the beginning and 161.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,875 INFO L158 Benchmark]: RCFGBuilder took 618.28ms. Allocated memory is still 200.3MB. Free memory was 161.0MB in the beginning and 122.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,875 INFO L158 Benchmark]: TraceAbstraction took 869167.05ms. Allocated memory was 200.3MB in the beginning and 895.5MB in the end (delta: 695.2MB). Free memory was 121.6MB in the beginning and 686.2MB in the end (delta: -564.5MB). Peak memory consumption was 130.1MB. Max. memory is 8.0GB. [2023-12-21 02:51:20,876 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-21 02:51:20,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 200.3MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.09ms. Allocated memory is still 200.3MB. Free memory was 141.0MB in the beginning and 123.4MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 102.03ms. Allocated memory is still 200.3MB. Free memory was 123.4MB in the beginning and 167.3MB in the end (delta: -43.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.65ms. Allocated memory is still 200.3MB. Free memory was 167.3MB in the beginning and 161.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 618.28ms. Allocated memory is still 200.3MB. Free memory was 161.0MB in the beginning and 122.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 869167.05ms. Allocated memory was 200.3MB in the beginning and 895.5MB in the end (delta: 695.2MB). Free memory was 121.6MB in the beginning and 686.2MB in the end (delta: -564.5MB). Peak memory consumption was 130.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (135states) and FLOYD_HOARE automaton (currently 15 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 869.1s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 821.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 2235 SdHoareTripleChecker+Valid, 56.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2234 mSDsluCounter, 4334 SdHoareTripleChecker+Invalid, 55.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3179 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5642 IncrementalHoareTripleChecker+Invalid, 5798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 1155 mSDtfsCounter, 5642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 602.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=4, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 242 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 46.6s InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1605 ConstructedInterpolants, 0 QuantifiedInterpolants, 34933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 9936/9936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown