/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_loopvsstraightlinecode_25-1loop_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:53:24,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:53:25,016 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-20 22:53:25,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:53:25,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:53:25,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:53:25,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:53:25,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:53:25,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:53:25,047 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:53:25,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:53:25,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:53:25,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:53:25,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:53:25,050 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:53:25,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:53:25,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:53:25,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:53:25,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:53:25,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:53:25,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:53:25,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:53:25,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:53:25,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:53:25,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:53:25,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:53:25,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:53:25,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:53:25,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:53:25,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:53:25,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:53:25,056 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-20 22:53:25,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:53:25,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:53:25,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:53:25,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:53:25,269 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:53:25,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-20 22:53:26,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:53:26,380 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:53:26,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-20 22:53:26,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43f1c83f/bea0667d259a4ed2ad7c68761fd2c8a8/FLAGd0b71bfce [2023-12-20 22:53:26,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43f1c83f/bea0667d259a4ed2ad7c68761fd2c8a8 [2023-12-20 22:53:26,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:53:26,400 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:53:26,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:53:26,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:53:26,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:53:26,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b98a9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26, skipping insertion in model container [2023-12-20 22:53:26,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:53:26,516 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_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-12-20 22:53:26,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:53:26,547 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:53:26,554 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_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-12-20 22:53:26,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:53:26,576 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:53:26,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26 WrapperNode [2023-12-20 22:53:26,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:53:26,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:53:26,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:53:26,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:53:26,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,610 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2023-12-20 22:53:26,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:53:26,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:53:26,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:53:26,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:53:26,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 22:53:26,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:53:26,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:53:26,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:53:26,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:53:26,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (1/1) ... [2023-12-20 22:53:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:53:26,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:53:26,685 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-20 22:53:26,706 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-20 22:53:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:53:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:53:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:53:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:53:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:53:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:53:26,798 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:53:26,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:53:26,963 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:53:26,988 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:53:26,988 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:53:26,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:53:26 BoogieIcfgContainer [2023-12-20 22:53:26,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:53:26,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:53:26,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:53:26,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:53:26,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:53:26" (1/3) ... [2023-12-20 22:53:26,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1a0630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:53:26, skipping insertion in model container [2023-12-20 22:53:26,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:26" (2/3) ... [2023-12-20 22:53:26,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1a0630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:53:26, skipping insertion in model container [2023-12-20 22:53:26,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:53:26" (3/3) ... [2023-12-20 22:53:26,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-20 22:53:27,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:53:27,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:53:27,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:53:27,039 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;@7d188069, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:53:27,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:53:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-20 22:53:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 22:53:27,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:27,047 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:27,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:27,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1168751156, now seen corresponding path program 1 times [2023-12-20 22:53:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759500437] [2023-12-20 22:53:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759500437] [2023-12-20 22:53:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759500437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:53:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284186071] [2023-12-20 22:53:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:53:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:27,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:53:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:53:27,291 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 22:53:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:27,333 INFO L93 Difference]: Finished difference Result 69 states and 108 transitions. [2023-12-20 22:53:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:53:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2023-12-20 22:53:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:27,339 INFO L225 Difference]: With dead ends: 69 [2023-12-20 22:53:27,339 INFO L226 Difference]: Without dead ends: 33 [2023-12-20 22:53:27,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-20 22:53:27,343 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:27,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-20 22:53:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-20 22:53:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-20 22:53:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-12-20 22:53:27,380 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 53 [2023-12-20 22:53:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:27,381 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-12-20 22:53:27,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 22:53:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-12-20 22:53:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 22:53:27,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:27,382 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:53:27,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:27,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1082888208, now seen corresponding path program 1 times [2023-12-20 22:53:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409929423] [2023-12-20 22:53:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409929423] [2023-12-20 22:53:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409929423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:53:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974651149] [2023-12-20 22:53:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:27,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:53:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:53:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:53:27,904 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:28,062 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2023-12-20 22:53:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 22:53:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2023-12-20 22:53:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:28,064 INFO L225 Difference]: With dead ends: 100 [2023-12-20 22:53:28,064 INFO L226 Difference]: Without dead ends: 68 [2023-12-20 22:53:28,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:53:28,065 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:28,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 108 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:53:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-20 22:53:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2023-12-20 22:53:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-20 22:53:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-20 22:53:28,099 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 53 [2023-12-20 22:53:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:28,099 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-20 22:53:28,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-20 22:53:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 22:53:28,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:28,114 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:53:28,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:28,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1762501363, now seen corresponding path program 1 times [2023-12-20 22:53:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599942474] [2023-12-20 22:53:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:29,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599942474] [2023-12-20 22:53:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599942474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 22:53:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202158577] [2023-12-20 22:53:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:29,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 22:53:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 22:53:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 22:53:29,164 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:29,449 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2023-12-20 22:53:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 22:53:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-20 22:53:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:29,451 INFO L225 Difference]: With dead ends: 146 [2023-12-20 22:53:29,451 INFO L226 Difference]: Without dead ends: 144 [2023-12-20 22:53:29,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-12-20 22:53:29,453 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 160 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:29,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 326 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 22:53:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-20 22:53:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2023-12-20 22:53:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 22:53:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2023-12-20 22:53:29,478 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 54 [2023-12-20 22:53:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:29,478 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2023-12-20 22:53:29,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2023-12-20 22:53:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 22:53:29,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:29,479 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:29,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:53:29,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:29,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1762441781, now seen corresponding path program 1 times [2023-12-20 22:53:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951969274] [2023-12-20 22:53:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951969274] [2023-12-20 22:53:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951969274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 22:53:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389705718] [2023-12-20 22:53:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:30,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 22:53:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 22:53:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:53:30,267 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:30,528 INFO L93 Difference]: Finished difference Result 332 states and 456 transitions. [2023-12-20 22:53:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 22:53:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-20 22:53:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:30,532 INFO L225 Difference]: With dead ends: 332 [2023-12-20 22:53:30,533 INFO L226 Difference]: Without dead ends: 238 [2023-12-20 22:53:30,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-20 22:53:30,544 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 127 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:30,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:53:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-20 22:53:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2023-12-20 22:53:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 123 states have internal predecessors, (154), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 22:53:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2023-12-20 22:53:30,595 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 54 [2023-12-20 22:53:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:30,595 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2023-12-20 22:53:30,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2023-12-20 22:53:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 22:53:30,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:30,596 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:53:30,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:30,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1061436785, now seen corresponding path program 1 times [2023-12-20 22:53:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031839940] [2023-12-20 22:53:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031839940] [2023-12-20 22:53:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031839940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:53:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130206993] [2023-12-20 22:53:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:30,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:53:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:53:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:53:30,627 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:30,653 INFO L93 Difference]: Finished difference Result 296 states and 409 transitions. [2023-12-20 22:53:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:53:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-20 22:53:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:30,654 INFO L225 Difference]: With dead ends: 296 [2023-12-20 22:53:30,655 INFO L226 Difference]: Without dead ends: 202 [2023-12-20 22:53:30,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:53:30,655 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:30,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-12-20 22:53:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2023-12-20 22:53:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 131 states have internal predecessors, (162), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 22:53:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2023-12-20 22:53:30,671 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 54 [2023-12-20 22:53:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:30,671 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2023-12-20 22:53:30,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2023-12-20 22:53:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:53:30,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:30,672 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:53:30,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:30,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 877017430, now seen corresponding path program 1 times [2023-12-20 22:53:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:30,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714867177] [2023-12-20 22:53:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714867177] [2023-12-20 22:53:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714867177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:53:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2485627] [2023-12-20 22:53:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:30,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:53:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:53:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:53:30,705 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:30,727 INFO L93 Difference]: Finished difference Result 253 states and 345 transitions. [2023-12-20 22:53:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:53:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-20 22:53:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:30,728 INFO L225 Difference]: With dead ends: 253 [2023-12-20 22:53:30,728 INFO L226 Difference]: Without dead ends: 92 [2023-12-20 22:53:30,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:53:30,729 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:30,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-20 22:53:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2023-12-20 22:53:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-20 22:53:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2023-12-20 22:53:30,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 55 [2023-12-20 22:53:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:30,737 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 108 transitions. [2023-12-20 22:53:30,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2023-12-20 22:53:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:53:30,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:30,738 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:30,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 22:53:30,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:30,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 196959060, now seen corresponding path program 1 times [2023-12-20 22:53:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137183419] [2023-12-20 22:53:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:31,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137183419] [2023-12-20 22:53:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137183419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 22:53:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074230385] [2023-12-20 22:53:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:31,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 22:53:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 22:53:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:53:31,070 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:31,188 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2023-12-20 22:53:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 22:53:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-20 22:53:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:31,190 INFO L225 Difference]: With dead ends: 124 [2023-12-20 22:53:31,190 INFO L226 Difference]: Without dead ends: 122 [2023-12-20 22:53:31,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:53:31,190 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:31,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 251 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:53:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-20 22:53:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2023-12-20 22:53:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 82 states have internal predecessors, (97), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 22:53:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2023-12-20 22:53:31,201 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 153 transitions. Word has length 55 [2023-12-20 22:53:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:31,201 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 153 transitions. [2023-12-20 22:53:31,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 153 transitions. [2023-12-20 22:53:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:53:31,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:31,202 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:53:31,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 22:53:31,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:31,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash 197018642, now seen corresponding path program 1 times [2023-12-20 22:53:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358861590] [2023-12-20 22:53:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 22:53:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358861590] [2023-12-20 22:53:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358861590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 22:53:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096605856] [2023-12-20 22:53:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:31,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 22:53:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 22:53:31,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:53:31,738 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:31,894 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2023-12-20 22:53:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 22:53:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-20 22:53:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:31,895 INFO L225 Difference]: With dead ends: 204 [2023-12-20 22:53:31,895 INFO L226 Difference]: Without dead ends: 138 [2023-12-20 22:53:31,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:53:31,896 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:31,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 163 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:53:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-20 22:53:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2023-12-20 22:53:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 88 states have internal predecessors, (103), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 22:53:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2023-12-20 22:53:31,906 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 55 [2023-12-20 22:53:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:31,906 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2023-12-20 22:53:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 22:53:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2023-12-20 22:53:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 22:53:31,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:31,907 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:53:31,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 22:53:31,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:31,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 247138124, now seen corresponding path program 1 times [2023-12-20 22:53:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002918023] [2023-12-20 22:53:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:53:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:53:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 22:53:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:53:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 22:53:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 22:53:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 22:53:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 22:53:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 22:53:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 22:53:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 22:53:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-20 22:53:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:31,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002918023] [2023-12-20 22:53:31,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002918023] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:53:31,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991582413] [2023-12-20 22:53:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:53:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:53:31,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:53:32,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 22:53:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:32,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 22:53:32,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:53:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-20 22:53:32,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 22:53:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991582413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:32,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 22:53:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-20 22:53:32,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415438448] [2023-12-20 22:53:32,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:32,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:53:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:53:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:53:32,142 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 22:53:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:32,161 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2023-12-20 22:53:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 22:53:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2023-12-20 22:53:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:32,161 INFO L225 Difference]: With dead ends: 144 [2023-12-20 22:53:32,161 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 22:53:32,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:53:32,162 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:32,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 22:53:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 22:53:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 22:53:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 22:53:32,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2023-12-20 22:53:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 22:53:32,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 22:53:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 22:53:32,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 22:53:32,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:53:32,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 22:53:32,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:53:32,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 22:53:32,674 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-20 22:53:32,674 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-20 22:53:32,674 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-20 22:53:32,674 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 35 60) no Hoare annotation was computed. [2023-12-20 22:53:32,674 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-20 22:53:32,675 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,676 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 22:53:32,676 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse5 (div ~last_1_var_1_11~0 4294967296))) (let ((.cse2 (= 256 ~var_1_5~0)) (.cse4 (= 256 ~last_1_var_1_5~0)) (.cse0 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse6 (= (+ 5 ~var_1_1~0) 0)) (.cse1 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse3 (* .cse5 4294967296))) (or (and .cse0 (= 256 ~var_1_11~0) (= 256 ~var_1_1~0) (not .cse1) .cse2 (not (= (+ 256 .cse3) ~last_1_var_1_11~0)) .cse4) (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse5 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse6 .cse1 .cse2 (= 8 ~var_1_11~0) .cse4) (let ((.cse9 (* 65536 (div ~last_1_var_1_5~0 65536)))) (and .cse0 (= (+ 5 ~var_1_11~0) 0) .cse6 .cse1 (let ((.cse8 (+ .cse9 ~var_1_6~0)) (.cse7 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse7) ~var_1_6~0) (<= (+ 8 .cse7 ~last_1_var_1_5~0) .cse8)) (and (<= .cse8 (+ 7 .cse7 ~last_1_var_1_5~0)) (= (+ .cse9 ~var_1_5~0) ~last_1_var_1_5~0)))) (or (not (= (+ .cse9 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 .cse3))) (= (* 65536 (div (+ ~last_1_var_1_11~0 4294967280) 65536)) (+ 4294901749 ~last_1_var_1_11~0)))))))) [2023-12-20 22:53:32,676 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-12-20 22:53:32,676 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 22:53:32,676 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,676 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,677 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-20 22:53:32,677 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-20 22:53:32,679 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:53:32,681 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:53:32,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:53:32 BoogieIcfgContainer [2023-12-20 22:53:32,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:53:32,702 INFO L158 Benchmark]: Toolchain (without parser) took 6302.03ms. Allocated memory was 257.9MB in the beginning and 412.1MB in the end (delta: 154.1MB). Free memory was 193.1MB in the beginning and 173.5MB in the end (delta: 19.5MB). Peak memory consumption was 174.7MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,702 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 215.0MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:53:32,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.65ms. Allocated memory is still 257.9MB. Free memory was 192.8MB in the beginning and 180.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 257.9MB. Free memory was 180.2MB in the beginning and 177.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,703 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 257.9MB. Free memory was 177.8MB in the beginning and 174.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,703 INFO L158 Benchmark]: RCFGBuilder took 345.91ms. Allocated memory is still 257.9MB. Free memory was 174.7MB in the beginning and 209.7MB in the end (delta: -35.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,703 INFO L158 Benchmark]: TraceAbstraction took 5711.89ms. Allocated memory was 257.9MB in the beginning and 412.1MB in the end (delta: 154.1MB). Free memory was 209.2MB in the beginning and 173.5MB in the end (delta: 35.7MB). Peak memory consumption was 189.8MB. Max. memory is 8.0GB. [2023-12-20 22:53:32,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 215.0MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.65ms. Allocated memory is still 257.9MB. Free memory was 192.8MB in the beginning and 180.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 257.9MB. Free memory was 180.2MB in the beginning and 177.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 257.9MB. Free memory was 177.8MB in the beginning and 174.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.91ms. Allocated memory is still 257.9MB. Free memory was 174.7MB in the beginning and 209.7MB in the end (delta: -35.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5711.89ms. Allocated memory was 257.9MB in the beginning and 412.1MB in the end (delta: 154.1MB). Free memory was 209.2MB in the beginning and 173.5MB in the end (delta: 35.7MB). Peak memory consumption was 189.8MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 396 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=5, InterpolantAutomatonStates: 52, 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, 9 MinimizatonAttempts, 170 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 141 PreInvPairs, 151 NumberOfFragments, 370 HoareAnnotationTreeSize, 141 FormulaSimplifications, 451 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 234 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1445/1446 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((((1 <= k_loop) && (256 == var_1_11)) && (256 == var_1_1)) && !(((256 * (var_1_4 / 256)) == var_1_4))) && (256 == var_1_5)) && !(((256 + ((last_1_var_1_11 / 4294967296) * 4294967296)) == last_1_var_1_11))) && (256 == last_1_var_1_5)) || ((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5))) || ((((((1 <= k_loop) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) RESULT: Ultimate proved your program to be correct! [2023-12-20 22:53:32,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...