/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:43:15,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:43:15,397 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-19 11:43:15,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:43:15,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:43:15,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:43:15,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:43:15,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:43:15,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:43:15,426 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:43:15,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:43:15,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:43:15,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:43:15,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:43:15,429 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:43:15,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:43:15,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:43:15,430 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:43:15,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:43:15,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:43:15,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:43:15,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:43:15,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:43:15,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:43:15,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:43:15,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:43:15,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:43:15,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:43:15,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:43:15,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:43:15,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:43:15,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:43:15,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:43:15,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:43:15,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:43:15,436 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:43:15,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:43:15,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:43:15,436 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 -> true [2023-12-19 11:43:15,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:43:15,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:43:15,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:43:15,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:43:15,634 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:43:15,634 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-5.i [2023-12-19 11:43:16,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:43:16,835 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:43:16,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-12-19 11:43:16,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a088d92/15dde92ae19c42e4a4e09e3545eae7db/FLAG7c70d3ddc [2023-12-19 11:43:16,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a088d92/15dde92ae19c42e4a4e09e3545eae7db [2023-12-19 11:43:16,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:43:16,858 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:43:16,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:43:16,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:43:16,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:43:16,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:43:16" (1/1) ... [2023-12-19 11:43:16,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1163414d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:16, skipping insertion in model container [2023-12-19 11:43:16,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:43:16" (1/1) ... [2023-12-19 11:43:16,888 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:43:16,977 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-5.i[914,927] [2023-12-19 11:43:17,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:43:17,015 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:43:17,023 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-5.i[914,927] [2023-12-19 11:43:17,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:43:17,048 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:43:17,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17 WrapperNode [2023-12-19 11:43:17,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:43:17,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:43:17,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:43:17,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:43:17,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,100 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-12-19 11:43:17,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:43:17,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:43:17,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:43:17,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:43:17,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,126 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-19 11:43:17,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:43:17,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:43:17,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:43:17,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:43:17,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (1/1) ... [2023-12-19 11:43:17,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:43:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:43:17,197 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-19 11:43:17,226 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-19 11:43:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:43:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:43:17,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:43:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:43:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:43:17,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:43:17,281 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:43:17,283 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:43:17,449 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:43:17,475 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:43:17,475 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:43:17,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:43:17 BoogieIcfgContainer [2023-12-19 11:43:17,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:43:17,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:43:17,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:43:17,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:43:17,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:43:16" (1/3) ... [2023-12-19 11:43:17,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc019f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:43:17, skipping insertion in model container [2023-12-19 11:43:17,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:17" (2/3) ... [2023-12-19 11:43:17,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc019f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:43:17, skipping insertion in model container [2023-12-19 11:43:17,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:43:17" (3/3) ... [2023-12-19 11:43:17,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-12-19 11:43:17,494 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:43:17,494 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:43:17,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:43:17,533 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;@5cf8bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:43:17,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:43:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 11:43:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 11:43:17,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:17,555 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:17,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:17,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -730090614, now seen corresponding path program 1 times [2023-12-19 11:43:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145068092] [2023-12-19 11:43:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145068092] [2023-12-19 11:43:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145068092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:43:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325454782] [2023-12-19 11:43:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:17,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:43:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:43:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:43:17,820 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:43:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:17,861 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2023-12-19 11:43:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:43:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2023-12-19 11:43:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:17,867 INFO L225 Difference]: With dead ends: 85 [2023-12-19 11:43:17,867 INFO L226 Difference]: Without dead ends: 41 [2023-12-19 11:43:17,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-19 11:43:17,872 INFO L413 NwaCegarLoop]: 57 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, 57 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-19 11:43:17,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:43:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-19 11:43:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-19 11:43:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 11:43:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-19 11:43:17,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2023-12-19 11:43:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:17,906 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-19 11:43:17,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:43:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-19 11:43:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 11:43:17,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:17,911 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:17,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:43:17,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:17,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -907529654, now seen corresponding path program 1 times [2023-12-19 11:43:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704632419] [2023-12-19 11:43:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:17,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704632419] [2023-12-19 11:43:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704632419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:43:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799641323] [2023-12-19 11:43:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:18,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:43:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:43:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:43:18,661 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:18,805 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2023-12-19 11:43:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:43:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 11:43:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:18,808 INFO L225 Difference]: With dead ends: 110 [2023-12-19 11:43:18,808 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 11:43:18,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:43:18,811 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:18,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:43:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 11:43:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-12-19 11:43:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 11:43:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2023-12-19 11:43:18,846 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2023-12-19 11:43:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:18,847 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2023-12-19 11:43:18,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2023-12-19 11:43:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 11:43:18,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:18,848 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:18,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:43:18,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:18,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -907470072, now seen corresponding path program 1 times [2023-12-19 11:43:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525071638] [2023-12-19 11:43:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525071638] [2023-12-19 11:43:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525071638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 11:43:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031446954] [2023-12-19 11:43:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:24,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 11:43:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:24,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 11:43:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 11:43:24,291 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:24,872 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2023-12-19 11:43:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 11:43:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 11:43:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:24,878 INFO L225 Difference]: With dead ends: 143 [2023-12-19 11:43:24,878 INFO L226 Difference]: Without dead ends: 141 [2023-12-19 11:43:24,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-19 11:43:24,882 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 90 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:24,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 186 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 11:43:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-19 11:43:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2023-12-19 11:43:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.2) internal successors, (96), 82 states have internal predecessors, (96), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 11:43:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 192 transitions. [2023-12-19 11:43:24,906 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 192 transitions. Word has length 89 [2023-12-19 11:43:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:24,907 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 192 transitions. [2023-12-19 11:43:24,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2023-12-19 11:43:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 11:43:24,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:24,911 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:24,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:43:24,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:24,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -850211770, now seen corresponding path program 1 times [2023-12-19 11:43:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486260087] [2023-12-19 11:43:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:24,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:24,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486260087] [2023-12-19 11:43:24,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486260087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:24,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:43:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914080602] [2023-12-19 11:43:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:24,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:43:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:43:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:43:24,989 INFO L87 Difference]: Start difference. First operand 133 states and 192 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:25,012 INFO L93 Difference]: Finished difference Result 261 states and 378 transitions. [2023-12-19 11:43:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:43:25,013 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 11:43:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:25,017 INFO L225 Difference]: With dead ends: 261 [2023-12-19 11:43:25,017 INFO L226 Difference]: Without dead ends: 129 [2023-12-19 11:43:25,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-19 11:43:25,024 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:25,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:43:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-19 11:43:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-12-19 11:43:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 11:43:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2023-12-19 11:43:25,045 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 89 [2023-12-19 11:43:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:25,046 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2023-12-19 11:43:25,046 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2023-12-19 11:43:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 11:43:25,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:25,050 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:25,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:43:25,051 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:25,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1716876280, now seen corresponding path program 1 times [2023-12-19 11:43:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:25,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630267355] [2023-12-19 11:43:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630267355] [2023-12-19 11:43:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630267355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:43:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600506817] [2023-12-19 11:43:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:43:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:43:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:43:25,104 INFO L87 Difference]: Start difference. First operand 129 states and 183 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:25,127 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2023-12-19 11:43:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:43:25,127 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 11:43:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:25,128 INFO L225 Difference]: With dead ends: 228 [2023-12-19 11:43:25,128 INFO L226 Difference]: Without dead ends: 100 [2023-12-19 11:43:25,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-19 11:43:25,129 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:25,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:43:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-19 11:43:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-19 11:43:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 11:43:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2023-12-19 11:43:25,150 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 89 [2023-12-19 11:43:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:25,151 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2023-12-19 11:43:25,151 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2023-12-19 11:43:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 11:43:25,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:25,152 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:25,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 11:43:25,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:25,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2029122244, now seen corresponding path program 1 times [2023-12-19 11:43:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:25,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478311444] [2023-12-19 11:43:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:26,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:26,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478311444] [2023-12-19 11:43:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478311444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:26,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 11:43:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026551366] [2023-12-19 11:43:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:26,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 11:43:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 11:43:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-19 11:43:26,653 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:26,818 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2023-12-19 11:43:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 11:43:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2023-12-19 11:43:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:26,819 INFO L225 Difference]: With dead ends: 119 [2023-12-19 11:43:26,819 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 11:43:26,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-12-19 11:43:26,820 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:26,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 221 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:43:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 11:43:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-12-19 11:43:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 11:43:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-12-19 11:43:26,830 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 90 [2023-12-19 11:43:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:26,830 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-12-19 11:43:26,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-12-19 11:43:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-19 11:43:26,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:26,831 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:26,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:43:26,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:26,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 645160051, now seen corresponding path program 1 times [2023-12-19 11:43:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743836729] [2023-12-19 11:43:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743836729] [2023-12-19 11:43:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743836729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 11:43:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064682421] [2023-12-19 11:43:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:27,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 11:43:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 11:43:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-19 11:43:27,453 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:27,662 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2023-12-19 11:43:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 11:43:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-19 11:43:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:27,663 INFO L225 Difference]: With dead ends: 132 [2023-12-19 11:43:27,663 INFO L226 Difference]: Without dead ends: 130 [2023-12-19 11:43:27,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-19 11:43:27,664 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:27,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 243 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:43:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-19 11:43:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2023-12-19 11:43:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 11:43:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-12-19 11:43:27,677 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 91 [2023-12-19 11:43:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:27,677 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-12-19 11:43:27,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-12-19 11:43:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-19 11:43:27,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:43:27,678 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:43:27,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 11:43:27,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:43:27,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:43:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 252133041, now seen corresponding path program 1 times [2023-12-19 11:43:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:43:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524691671] [2023-12-19 11:43:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:43:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:43:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:43:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:43:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:43:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:43:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:43:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:43:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:43:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 11:43:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:43:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 11:43:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 11:43:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 11:43:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 11:43:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 11:43:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:43:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:43:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:43:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524691671] [2023-12-19 11:43:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524691671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:43:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:43:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 11:43:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501298940] [2023-12-19 11:43:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:43:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 11:43:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:43:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 11:43:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:43:29,820 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:43:30,178 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2023-12-19 11:43:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 11:43:30,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-19 11:43:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:43:30,178 INFO L225 Difference]: With dead ends: 130 [2023-12-19 11:43:30,178 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 11:43:30,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-19 11:43:30,179 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 33 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 11:43:30,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 243 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 11:43:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 11:43:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 11:43:30,180 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-19 11:43:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 11:43:30,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2023-12-19 11:43:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:43:30,180 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 11:43:30,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 11:43:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 11:43:30,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 11:43:30,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:43:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 11:43:30,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 11:43:30,577 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,577 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,577 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 11:43:30,577 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 11:43:30,577 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 11:43:30,577 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-19 11:43:30,577 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,578 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,578 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-19 11:43:30,578 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-19 11:43:30,578 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-19 11:43:30,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 11:43:30,578 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-12-19 11:43:30,578 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-12-19 11:43:30,578 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-19 11:43:30,578 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,578 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 56) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 56) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L83(lines 62 84) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-19 11:43:30,579 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 38 48) no Hoare annotation was computed. [2023-12-19 11:43:30,579 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,579 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,580 INFO L895 garLoopResultBuilder]: At program point L96-3(lines 96 102) the Hoare annotation is: (let ((.cse4 (* 256 (div ~var_1_12~0 256)))) (let ((.cse5 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (.cse0 (let ((.cse6 (* (div ~var_1_8~0 256) 256))) (let ((.cse7 (+ .cse6 ~var_1_12~0))) (or (and (= (+ .cse6 ~var_1_15~0) ~var_1_8~0) (<= .cse7 (+ .cse4 ~var_1_8~0))) (and (<= (+ .cse4 ~var_1_8~0 1) .cse7) (= (+ .cse4 ~var_1_15~0) ~var_1_12~0))))))) (or (and (= ~var_1_1~0 0) .cse0) (and (= ~var_1_8~0 10) (or (let ((.cse2 (+ (* 256 (div ~last_1_var_1_8~0 256)) ~var_1_7~0 ~var_1_10~0)) (.cse1 (= (+ (* (div ~var_1_13~0 256) 256) 10) ~var_1_13~0))) (and (or .cse1 (< (+ ~var_1_4~0 ~last_1_var_1_8~0) .cse2)) (or (< .cse2 (+ ~var_1_4~0 ~last_1_var_1_8~0 1)) (let ((.cse3 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0))) (and (or .cse1 (not .cse3)) (or .cse3 (= (+ .cse4 10) ~var_1_12~0))))))) .cse5)) (and (not .cse5) .cse0)))) [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L96-4(lines 96 102) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,580 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 (* (div ~var_1_8~0 256) 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (= ~var_1_8~0 10)))) [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 11:43:30,580 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 11:43:30,583 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:43:30,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:43:30,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:43:30 BoogieIcfgContainer [2023-12-19 11:43:30,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:43:30,594 INFO L158 Benchmark]: Toolchain (without parser) took 13736.31ms. Allocated memory was 202.4MB in the beginning and 566.2MB in the end (delta: 363.9MB). Free memory was 154.6MB in the beginning and 420.6MB in the end (delta: -265.9MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,594 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 202.4MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:43:30,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.84ms. Allocated memory is still 202.4MB. Free memory was 154.6MB in the beginning and 141.6MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 202.4MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,595 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 202.4MB. Free memory was 138.5MB in the beginning and 134.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,595 INFO L158 Benchmark]: RCFGBuilder took 337.79ms. Allocated memory is still 202.4MB. Free memory was 134.3MB in the beginning and 115.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,595 INFO L158 Benchmark]: TraceAbstraction took 13116.81ms. Allocated memory was 202.4MB in the beginning and 566.2MB in the end (delta: 363.9MB). Free memory was 114.8MB in the beginning and 420.6MB in the end (delta: -305.8MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2023-12-19 11:43:30,596 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.43ms. Allocated memory is still 202.4MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.84ms. Allocated memory is still 202.4MB. Free memory was 154.6MB in the beginning and 141.6MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 202.4MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 202.4MB. Free memory was 138.5MB in the beginning and 134.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 337.79ms. Allocated memory is still 202.4MB. Free memory was 134.3MB in the beginning and 115.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 13116.81ms. Allocated memory was 202.4MB in the beginning and 566.2MB in the end (delta: 363.9MB). Free memory was 114.8MB in the beginning and 420.6MB in the end (delta: -305.8MB). Peak memory consumption was 58.5MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1331 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 852 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 479 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 181 PreInvPairs, 228 NumberOfFragments, 758 HoareAnnotationTreeSize, 181 FormulaSimplifications, 1954 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FormulaSimplificationsInter, 1576 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2912/2912 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: 96]: Loop Invariant Derived loop invariant: ((((var_1_1 == 0) && ((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12)))) || ((var_1_8 == 10) && (((((((var_1_13 / 256) * 256) + 10) == var_1_13) || ((var_1_4 + last_1_var_1_8) < (((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10))) && (((((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10) < ((var_1_4 + last_1_var_1_8) + 1)) || ((((((var_1_13 / 256) * 256) + 10) == var_1_13) || !((((var_1_11 / 256) * 256) == var_1_11))) && ((((var_1_11 / 256) * 256) == var_1_11) || (((256 * (var_1_12 / 256)) + 10) == var_1_12))))) || (((var_1_9 / 256) * 256) == var_1_9)))) || (!((((var_1_9 / 256) * 256) == var_1_9)) && ((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12))))) RESULT: Ultimate proved your program to be correct! [2023-12-19 11:43:30,643 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...