/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 00:23:30,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 00:23:30,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 00:23:30,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 00:23:30,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 00:23:30,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 00:23:30,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 00:23:30,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 00:23:30,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 00:23:30,204 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 00:23:30,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 00:23:30,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 00:23:30,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 00:23:30,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 00:23:30,207 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 00:23:30,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 00:23:30,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 00:23:30,207 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 00:23:30,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 00:23:30,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 00:23:30,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 00:23:30,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 00:23:30,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 00:23:30,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 00:23:30,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 00:23:30,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 00:23:30,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 00:23:30,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:23:30,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 00:23:30,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 00:23:30,213 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 00:23:30,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 00:23:30,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 00:23:30,213 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 00:23:30,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 00:23:30,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 00:23:30,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 00:23:30,467 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 00:23:30,467 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 00:23:30,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2023-12-21 00:23:31,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 00:23:31,684 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 00:23:31,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2023-12-21 00:23:31,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054376dd9/7d45db2e790746a5b3ecc12196c17458/FLAG956d665c4 [2023-12-21 00:23:31,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054376dd9/7d45db2e790746a5b3ecc12196c17458 [2023-12-21 00:23:31,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 00:23:31,702 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 00:23:31,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 00:23:31,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 00:23:31,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 00:23:31,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b1fb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31, skipping insertion in model container [2023-12-21 00:23:31,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,727 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 00:23:31,827 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_operatoramount_amount25_file-39.i[915,928] [2023-12-21 00:23:31,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:23:31,859 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 00:23:31,868 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_operatoramount_amount25_file-39.i[915,928] [2023-12-21 00:23:31,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:23:31,895 INFO L206 MainTranslator]: Completed translation [2023-12-21 00:23:31,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31 WrapperNode [2023-12-21 00:23:31,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 00:23:31,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 00:23:31,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 00:23:31,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 00:23:31,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,925 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2023-12-21 00:23:31,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 00:23:31,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 00:23:31,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 00:23:31,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 00:23:31,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,950 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-21 00:23:31,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 00:23:31,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 00:23:31,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 00:23:31,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 00:23:31,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (1/1) ... [2023-12-21 00:23:31,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:23:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:23:32,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 00:23:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 00:23:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 00:23:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 00:23:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 00:23:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 00:23:32,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 00:23:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 00:23:32,111 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 00:23:32,115 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 00:23:32,279 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 00:23:32,313 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 00:23:32,313 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 00:23:32,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:23:32 BoogieIcfgContainer [2023-12-21 00:23:32,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 00:23:32,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 00:23:32,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 00:23:32,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 00:23:32,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:23:31" (1/3) ... [2023-12-21 00:23:32,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762ef356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:23:32, skipping insertion in model container [2023-12-21 00:23:32,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:23:31" (2/3) ... [2023-12-21 00:23:32,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762ef356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:23:32, skipping insertion in model container [2023-12-21 00:23:32,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:23:32" (3/3) ... [2023-12-21 00:23:32,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-39.i [2023-12-21 00:23:32,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 00:23:32,332 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 00:23:32,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 00:23:32,380 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;@3e83d1b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 00:23:32,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 00:23:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-21 00:23:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-21 00:23:32,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:32,401 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:32,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:32,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1160943542, now seen corresponding path program 1 times [2023-12-21 00:23:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:32,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952648752] [2023-12-21 00:23:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-21 00:23:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952648752] [2023-12-21 00:23:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952648752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:33,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:33,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 00:23:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949748836] [2023-12-21 00:23:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:33,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 00:23:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 00:23:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 00:23:33,909 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 00:23:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:34,432 INFO L93 Difference]: Finished difference Result 146 states and 264 transitions. [2023-12-21 00:23:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 00:23:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2023-12-21 00:23:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:34,444 INFO L225 Difference]: With dead ends: 146 [2023-12-21 00:23:34,445 INFO L226 Difference]: Without dead ends: 106 [2023-12-21 00:23:34,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-21 00:23:34,449 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 65 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:34,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 246 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 00:23:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-21 00:23:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2023-12-21 00:23:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 00:23:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-21 00:23:34,524 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2023-12-21 00:23:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:34,525 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-21 00:23:34,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 00:23:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-21 00:23:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 00:23:34,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:34,529 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:34,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 00:23:34,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:34,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1380550262, now seen corresponding path program 1 times [2023-12-21 00:23:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:34,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711727409] [2023-12-21 00:23:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-21 00:23:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711727409] [2023-12-21 00:23:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711727409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:35,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 00:23:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814966556] [2023-12-21 00:23:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:35,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 00:23:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:35,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 00:23:35,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 00:23:35,399 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:35,690 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2023-12-21 00:23:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 00:23:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-21 00:23:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:35,694 INFO L225 Difference]: With dead ends: 106 [2023-12-21 00:23:35,694 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 00:23:35,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-21 00:23:35,695 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:35,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 185 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 00:23:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 00:23:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2023-12-21 00:23:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 00:23:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-21 00:23:35,720 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 84 [2023-12-21 00:23:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:35,721 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-21 00:23:35,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-21 00:23:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 00:23:35,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:35,726 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:35,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 00:23:35,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:35,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1380490680, now seen corresponding path program 1 times [2023-12-21 00:23:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211364096] [2023-12-21 00:23:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-21 00:23:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211364096] [2023-12-21 00:23:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211364096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 00:23:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342589717] [2023-12-21 00:23:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 00:23:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 00:23:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-21 00:23:36,594 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:36,797 INFO L93 Difference]: Finished difference Result 100 states and 140 transitions. [2023-12-21 00:23:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 00:23:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-21 00:23:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:36,800 INFO L225 Difference]: With dead ends: 100 [2023-12-21 00:23:36,800 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 00:23:36,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-21 00:23:36,804 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:36,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 00:23:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 00:23:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2023-12-21 00:23:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 00:23:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-21 00:23:36,833 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 84 [2023-12-21 00:23:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:36,835 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-21 00:23:36,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-21 00:23:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-21 00:23:36,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:36,837 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 00:23:36,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:36,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1628913695, now seen corresponding path program 1 times [2023-12-21 00:23:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944087589] [2023-12-21 00:23:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-21 00:23:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944087589] [2023-12-21 00:23:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944087589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 00:23:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375007734] [2023-12-21 00:23:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:36,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 00:23:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 00:23:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 00:23:36,981 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:37,060 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2023-12-21 00:23:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 00:23:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2023-12-21 00:23:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:37,062 INFO L225 Difference]: With dead ends: 216 [2023-12-21 00:23:37,062 INFO L226 Difference]: Without dead ends: 128 [2023-12-21 00:23:37,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 00:23:37,063 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 00:23:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-21 00:23:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2023-12-21 00:23:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-21 00:23:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2023-12-21 00:23:37,089 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 85 [2023-12-21 00:23:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:37,090 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2023-12-21 00:23:37,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2023-12-21 00:23:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-21 00:23:37,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:37,091 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:37,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 00:23:37,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:37,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1298593554, now seen corresponding path program 1 times [2023-12-21 00:23:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910027850] [2023-12-21 00:23:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-21 00:23:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 00:23:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 00:23:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-21 00:23:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-21 00:23:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-21 00:23:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 00:23:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 00:23:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 00:23:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 00:23:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-21 00:23:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-21 00:23:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 00:23:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2023-12-21 00:23:37,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910027850] [2023-12-21 00:23:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910027850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:37,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 00:23:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161815012] [2023-12-21 00:23:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:37,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 00:23:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 00:23:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 00:23:37,892 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:38,166 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2023-12-21 00:23:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 00:23:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2023-12-21 00:23:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:38,168 INFO L225 Difference]: With dead ends: 144 [2023-12-21 00:23:38,168 INFO L226 Difference]: Without dead ends: 142 [2023-12-21 00:23:38,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-12-21 00:23:38,169 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:38,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 226 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 00:23:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-21 00:23:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2023-12-21 00:23:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-21 00:23:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2023-12-21 00:23:38,199 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 168 [2023-12-21 00:23:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:38,200 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2023-12-21 00:23:38,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2023-12-21 00:23:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-21 00:23:38,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:23:38,201 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 00:23:38,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 00:23:38,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:23:38,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:23:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1298533972, now seen corresponding path program 1 times [2023-12-21 00:23:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:23:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369434342] [2023-12-21 00:23:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:23:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:23:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:23:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:23:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:23:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:23:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 00:23:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 00:23:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 00:23:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 00:23:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 00:23:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 00:23:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 00:23:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 00:23:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 00:23:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-21 00:23:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 00:23:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 00:23:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-21 00:23:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-21 00:23:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-21 00:23:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 00:23:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 00:23:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 00:23:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 00:23:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-21 00:23:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-21 00:23:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 00:23:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:23:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2023-12-21 00:23:39,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:23:39,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369434342] [2023-12-21 00:23:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369434342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:23:39,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:23:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 00:23:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776318548] [2023-12-21 00:23:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:23:39,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 00:23:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:23:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 00:23:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-21 00:23:39,027 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:23:39,229 INFO L93 Difference]: Finished difference Result 125 states and 178 transitions. [2023-12-21 00:23:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 00:23:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2023-12-21 00:23:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:23:39,231 INFO L225 Difference]: With dead ends: 125 [2023-12-21 00:23:39,231 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 00:23:39,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-12-21 00:23:39,233 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 00:23:39,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 197 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 00:23:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 00:23:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 00:23:39,234 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-21 00:23:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 00:23:39,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2023-12-21 00:23:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:23:39,234 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 00:23:39,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-21 00:23:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 00:23:39,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 00:23:39,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 00:23:39,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 00:23:39,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 00:23:39,990 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-12-21 00:23:39,991 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-12-21 00:23:39,991 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-12-21 00:23:39,991 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-21 00:23:39,992 INFO L902 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: true [2023-12-21 00:23:39,992 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-21 00:23:39,992 INFO L895 garLoopResultBuilder]: At program point L94-2(lines 94 100) the Hoare annotation is: (let ((.cse3 (div ~var_1_14~0 256))) (let ((.cse11 (* ~var_1_14~0 65535)) (.cse0 (* 256 .cse3))) (let ((.cse2 (not (= (+ .cse0 ~var_1_11~0) ~var_1_14~0))) (.cse4 (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse0))) (.cse1 (div (+ .cse11 16 (* (- 16776960) .cse3)) 65536))) (or (and (or (< (+ .cse0 .cse1) ~var_1_14~0) (< 9 ~var_1_14~0)) (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (or .cse2 (< ~var_1_11~0 128)) (<= .cse3 0) (or (< 0 (+ 129 ~var_1_11~0)) .cse4)) (let ((.cse14 (* (div ~var_1_10~0 256) 256))) (let ((.cse8 (= .cse14 ~var_1_10~0)) (.cse12 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse13 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0))) (let ((.cse7 (and (= ~var_1_10~0 (+ .cse14 1)) (or (not .cse12) (not .cse13)))) (.cse5 (and .cse12 .cse13)) (.cse6 (not .cse8))) (and (= (+ ~var_1_6~0 .cse0) ~var_1_14~0) (or .cse2 .cse5 .cse6) (or .cse7 .cse2 .cse8) (or (= (+ (* (div ~var_1_16~0 256) 256) ~var_1_14~0) (+ .cse0 ~var_1_16~0)) (< ~var_1_3~0 ~last_1_var_1_6~0) (= (* 256 (div ~last_1_var_1_10~0 256)) ~last_1_var_1_10~0)) (or .cse7 .cse4 .cse8) (or .cse4 .cse5 .cse6) (let ((.cse9 (* 65536 .cse1)) (.cse10 (* .cse3 16776960))) (or (and (= (+ 65520 .cse9 ~var_1_1~0 .cse10) .cse11) (<= (+ 32752 .cse9 .cse10) .cse11)) (and (<= .cse11 (+ 32751 .cse9 .cse10)) (= (+ .cse11 16) (+ .cse9 ~var_1_1~0 .cse10))))))))))))) [2023-12-21 00:23:39,992 INFO L899 garLoopResultBuilder]: For program point L94-3(lines 94 100) no Hoare annotation was computed. [2023-12-21 00:23:39,992 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 00:23:39,992 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L902 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: true [2023-12-21 00:23:39,993 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-12-21 00:23:39,994 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-21 00:23:39,994 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-21 00:23:39,997 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-21 00:23:39,998 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 00:23:40,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 12:23:40 BoogieIcfgContainer [2023-12-21 00:23:40,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 00:23:40,030 INFO L158 Benchmark]: Toolchain (without parser) took 8327.95ms. Allocated memory was 190.8MB in the beginning and 413.1MB in the end (delta: 222.3MB). Free memory was 144.6MB in the beginning and 342.1MB in the end (delta: -197.5MB). Peak memory consumption was 182.7MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,030 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 190.8MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 00:23:40,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.97ms. Allocated memory is still 190.8MB. Free memory was 144.1MB in the beginning and 131.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.38ms. Allocated memory is still 190.8MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,030 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 190.8MB. Free memory was 128.9MB in the beginning and 124.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,031 INFO L158 Benchmark]: RCFGBuilder took 346.52ms. Allocated memory is still 190.8MB. Free memory was 124.7MB in the beginning and 107.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,031 INFO L158 Benchmark]: TraceAbstraction took 7714.04ms. Allocated memory was 190.8MB in the beginning and 413.1MB in the end (delta: 222.3MB). Free memory was 107.4MB in the beginning and 342.1MB in the end (delta: -234.8MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2023-12-21 00:23:40,032 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.51ms. Allocated memory is still 190.8MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.97ms. Allocated memory is still 190.8MB. Free memory was 144.1MB in the beginning and 131.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.38ms. Allocated memory is still 190.8MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 190.8MB. Free memory was 128.9MB in the beginning and 124.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 346.52ms. Allocated memory is still 190.8MB. Free memory was 124.7MB in the beginning and 107.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7714.04ms. Allocated memory was 190.8MB in the beginning and 413.1MB in the end (delta: 222.3MB). Free memory was 107.4MB in the beginning and 342.1MB in the end (delta: -234.8MB). Peak memory consumption was 146.0MB. 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 1136 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 809 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 552 IncrementalHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 327 mSDtfsCounter, 552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 77 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 92 PreInvPairs, 135 NumberOfFragments, 381 HoareAnnotationTreeSize, 92 FormulaSimplifications, 31590 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 15 FormulaSimplificationsInter, 3501 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 5801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3908/3908 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: 94]: Loop Invariant Derived loop invariant: ((((((((((256 * (var_1_14 / 256)) + ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) < var_1_14) || (9 < var_1_14)) && (var_1_10 == 0)) && (last_1_var_1_10 == 0)) && (!((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14)) || (var_1_11 < 128))) && ((var_1_14 / 256) <= 0)) && ((0 < (129 + var_1_11)) || !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256)))))) || ((((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && ((!((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14)) || ((((var_1_13 / 256) * 256) == var_1_13) && ((256 * (var_1_12 / 256)) == var_1_12))) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((var_1_10 == (((var_1_10 / 256) * 256) + 1)) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((((var_1_10 == (((var_1_10 / 256) * 256) + 1)) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((!(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256)))) || ((((var_1_13 / 256) * 256) == var_1_13) && ((256 * (var_1_12 / 256)) == var_1_12))) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) RESULT: Ultimate proved your program to be correct! [2023-12-21 00:23:40,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...