/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:05:41,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:05:41,340 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-15 23:05:41,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:05:41,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:05:41,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:05:41,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:05:41,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:05:41,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:05:41,368 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:05:41,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:05:41,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:05:41,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:05:41,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:05:41,371 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:05:41,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:05:41,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:05:41,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:05:41,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:05:41,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:05:41,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:05:41,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:05:41,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:05:41,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:05:41,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:05:41,374 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:05:41,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:05:41,374 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:05:41,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:05:41,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:05:41,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:05:41,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:05:41,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:05:41,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:05:41,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:05:41,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:05:41,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:05:41,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 23:05:41,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:05:41,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:05:41,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:05:41,564 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:05:41,568 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:05:41,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-15 23:05:42,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:05:42,755 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:05:42,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-15 23:05:42,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a6cfbb22/a67c5ba5f7d4423f96c3d20324319416/FLAG1a9df6e36 [2023-12-15 23:05:42,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a6cfbb22/a67c5ba5f7d4423f96c3d20324319416 [2023-12-15 23:05:42,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:05:42,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:05:42,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:05:42,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:05:42,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:05:42,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc0f9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42, skipping insertion in model container [2023-12-15 23:05:42,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,796 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:05:42,874 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-15 23:05:42,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:05:42,908 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:05:42,915 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-15 23:05:42,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:05:42,941 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:05:42,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42 WrapperNode [2023-12-15 23:05:42,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:05:42,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:05:42,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:05:42,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:05:42,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,968 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-12-15 23:05:42,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:05:42,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:05:42,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:05:42,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:05:42,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,983 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-15 23:05:42,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:05:42,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:05:42,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:05:42,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:05:42,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (1/1) ... [2023-12-15 23:05:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:05:43,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:43,015 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-15 23:05:43,025 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-15 23:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-15 23:05:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-15 23:05:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-15 23:05:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-15 23:05:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-15 23:05:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-15 23:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:05:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:05:43,092 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:05:43,093 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:05:43,295 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:05:43,334 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:05:43,334 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 23:05:43,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:05:43 BoogieIcfgContainer [2023-12-15 23:05:43,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:05:43,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:05:43,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:05:43,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:05:43,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:05:42" (1/3) ... [2023-12-15 23:05:43,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa6b1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:05:43, skipping insertion in model container [2023-12-15 23:05:43,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:05:42" (2/3) ... [2023-12-15 23:05:43,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa6b1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:05:43, skipping insertion in model container [2023-12-15 23:05:43,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:05:43" (3/3) ... [2023-12-15 23:05:43,340 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-12-15 23:05:43,351 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:05:43,351 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 23:05:43,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:05:43,401 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;@30ab4540, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:05:43,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 23:05:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 23:05:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-15 23:05:43,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:43,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:43,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:43,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-12-15 23:05:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286810744] [2023-12-15 23:05:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 23:05:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:05:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-15 23:05:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:05:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286810744] [2023-12-15 23:05:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286810744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:05:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:05:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486266731] [2023-12-15 23:05:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:43,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:05:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:05:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:05:43,857 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 23:05:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:44,408 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2023-12-15 23:05:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:05:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-15 23:05:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:44,417 INFO L225 Difference]: With dead ends: 246 [2023-12-15 23:05:44,417 INFO L226 Difference]: Without dead ends: 158 [2023-12-15 23:05:44,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-15 23:05:44,421 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 303 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:44,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 295 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:05:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-15 23:05:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-12-15 23:05:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 85 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-15 23:05:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-12-15 23:05:44,453 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 39 [2023-12-15 23:05:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:44,453 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-12-15 23:05:44,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 23:05:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-12-15 23:05:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 23:05:44,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:44,456 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:44,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:05:44,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:44,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash -609134686, now seen corresponding path program 1 times [2023-12-15 23:05:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128239700] [2023-12-15 23:05:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 23:05:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 23:05:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 23:05:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:05:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:05:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:05:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128239700] [2023-12-15 23:05:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128239700] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656858135] [2023-12-15 23:05:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:44,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:44,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 23:05:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:44,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 23:05:44,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 23:05:44,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:44,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656858135] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-15 23:05:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678378996] [2023-12-15 23:05:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:05:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:05:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:44,766 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:44,792 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2023-12-15 23:05:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:05:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-15 23:05:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:44,793 INFO L225 Difference]: With dead ends: 194 [2023-12-15 23:05:44,794 INFO L226 Difference]: Without dead ends: 101 [2023-12-15 23:05:44,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:44,795 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:44,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-15 23:05:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-15 23:05:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 85 states have internal predecessors, (133), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-15 23:05:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2023-12-15 23:05:44,805 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 92 [2023-12-15 23:05:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:44,806 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2023-12-15 23:05:44,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2023-12-15 23:05:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 23:05:44,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:44,811 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:44,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 23:05:45,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:45,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:45,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1751637152, now seen corresponding path program 1 times [2023-12-15 23:05:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:45,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127883339] [2023-12-15 23:05:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 23:05:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 23:05:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 23:05:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:05:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:05:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:05:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127883339] [2023-12-15 23:05:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127883339] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230564874] [2023-12-15 23:05:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:45,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:45,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:45,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 23:05:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:45,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 23:05:45,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230564874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500394458] [2023-12-15 23:05:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:45,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:45,426 INFO L87 Difference]: Start difference. First operand 101 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:45,564 INFO L93 Difference]: Finished difference Result 302 states and 471 transitions. [2023-12-15 23:05:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-15 23:05:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:45,571 INFO L225 Difference]: With dead ends: 302 [2023-12-15 23:05:45,571 INFO L226 Difference]: Without dead ends: 211 [2023-12-15 23:05:45,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:45,575 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:45,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-15 23:05:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-12-15 23:05:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 168 states have internal predecessors, (260), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2023-12-15 23:05:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2023-12-15 23:05:45,607 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 92 [2023-12-15 23:05:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:45,607 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2023-12-15 23:05:45,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2023-12-15 23:05:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 23:05:45,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:45,609 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:45,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:45,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-15 23:05:45,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:45,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1617302816, now seen corresponding path program 1 times [2023-12-15 23:05:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464014729] [2023-12-15 23:05:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 23:05:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 23:05:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 23:05:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:05:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:05:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:05:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464014729] [2023-12-15 23:05:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464014729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570717430] [2023-12-15 23:05:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:45,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:46,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 23:05:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:46,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 23:05:46,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570717430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930725034] [2023-12-15 23:05:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:46,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:46,106 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:46,237 INFO L93 Difference]: Finished difference Result 593 states and 936 transitions. [2023-12-15 23:05:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-15 23:05:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:46,239 INFO L225 Difference]: With dead ends: 593 [2023-12-15 23:05:46,239 INFO L226 Difference]: Without dead ends: 409 [2023-12-15 23:05:46,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:46,240 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 215 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:46,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-15 23:05:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 395. [2023-12-15 23:05:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 328 states have (on average 1.5609756097560976) internal successors, (512), 337 states have internal predecessors, (512), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2023-12-15 23:05:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 620 transitions. [2023-12-15 23:05:46,264 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 620 transitions. Word has length 92 [2023-12-15 23:05:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:46,264 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 620 transitions. [2023-12-15 23:05:46,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2023-12-15 23:05:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 23:05:46,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:46,266 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:46,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:46,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:46,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:46,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1468221796, now seen corresponding path program 1 times [2023-12-15 23:05:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677332533] [2023-12-15 23:05:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 23:05:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 23:05:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 23:05:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:05:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:05:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:05:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677332533] [2023-12-15 23:05:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677332533] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800214908] [2023-12-15 23:05:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:46,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:46,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:46,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 23:05:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:46,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:46,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 23:05:46,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:46,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800214908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:46,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581820198] [2023-12-15 23:05:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:46,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:46,842 INFO L87 Difference]: Start difference. First operand 395 states and 620 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:47,003 INFO L93 Difference]: Finished difference Result 1308 states and 2136 transitions. [2023-12-15 23:05:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:47,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-15 23:05:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:47,007 INFO L225 Difference]: With dead ends: 1308 [2023-12-15 23:05:47,007 INFO L226 Difference]: Without dead ends: 935 [2023-12-15 23:05:47,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:47,008 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 233 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:47,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 355 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-12-15 23:05:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 863. [2023-12-15 23:05:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 722 states have (on average 1.5401662049861495) internal successors, (1112), 749 states have internal predecessors, (1112), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2023-12-15 23:05:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1386 transitions. [2023-12-15 23:05:47,044 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1386 transitions. Word has length 92 [2023-12-15 23:05:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:47,044 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1386 transitions. [2023-12-15 23:05:47,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1386 transitions. [2023-12-15 23:05:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 23:05:47,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:47,047 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:47,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:47,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:47,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:47,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2131635018, now seen corresponding path program 1 times [2023-12-15 23:05:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090983253] [2023-12-15 23:05:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 23:05:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 23:05:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:05:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 23:05:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:05:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:05:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:05:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090983253] [2023-12-15 23:05:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090983253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434798537] [2023-12-15 23:05:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:47,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:47,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:47,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:47,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 23:05:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:47,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:47,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 23:05:47,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434798537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:47,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115853971] [2023-12-15 23:05:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:47,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:47,492 INFO L87 Difference]: Start difference. First operand 863 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:47,658 INFO L93 Difference]: Finished difference Result 2816 states and 4760 transitions. [2023-12-15 23:05:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:47,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-15 23:05:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:47,664 INFO L225 Difference]: With dead ends: 2816 [2023-12-15 23:05:47,664 INFO L226 Difference]: Without dead ends: 1993 [2023-12-15 23:05:47,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:47,682 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 223 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:47,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 332 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-12-15 23:05:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1885. [2023-12-15 23:05:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1578 states have (on average 1.5158428390367553) internal successors, (2392), 1659 states have internal predecessors, (2392), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2023-12-15 23:05:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3148 transitions. [2023-12-15 23:05:47,783 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3148 transitions. Word has length 94 [2023-12-15 23:05:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:47,783 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 3148 transitions. [2023-12-15 23:05:47,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3148 transitions. [2023-12-15 23:05:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 23:05:47,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:47,791 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:47,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:47,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:47,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash -86155466, now seen corresponding path program 1 times [2023-12-15 23:05:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730208294] [2023-12-15 23:05:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 23:05:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 23:05:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:05:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 23:05:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:05:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:05:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:05:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730208294] [2023-12-15 23:05:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730208294] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971280888] [2023-12-15 23:05:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:48,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:48,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:48,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 23:05:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 23:05:48,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:05:48,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971280888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-15 23:05:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577290241] [2023-12-15 23:05:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:48,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:05:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:05:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:05:48,254 INFO L87 Difference]: Start difference. First operand 1885 states and 3148 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:48,338 INFO L93 Difference]: Finished difference Result 4002 states and 6653 transitions. [2023-12-15 23:05:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:05:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-15 23:05:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:48,346 INFO L225 Difference]: With dead ends: 4002 [2023-12-15 23:05:48,346 INFO L226 Difference]: Without dead ends: 2221 [2023-12-15 23:05:48,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-15 23:05:48,350 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 28 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:48,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2023-12-15 23:05:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1949. [2023-12-15 23:05:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1626 states have (on average 1.5006150061500616) internal successors, (2440), 1707 states have internal predecessors, (2440), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2023-12-15 23:05:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3228 transitions. [2023-12-15 23:05:48,444 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3228 transitions. Word has length 94 [2023-12-15 23:05:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:48,444 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3228 transitions. [2023-12-15 23:05:48,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3228 transitions. [2023-12-15 23:05:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 23:05:48,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:48,450 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:48,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:48,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:48,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:48,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1452184564, now seen corresponding path program 1 times [2023-12-15 23:05:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708351784] [2023-12-15 23:05:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 23:05:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 23:05:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:05:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 23:05:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:05:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:05:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:05:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708351784] [2023-12-15 23:05:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708351784] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894979737] [2023-12-15 23:05:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:48,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:48,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:48,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:48,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 23:05:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:48,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:05:48,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 23:05:48,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894979737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-15 23:05:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534049954] [2023-12-15 23:05:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:48,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:05:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:48,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:05:48,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:48,857 INFO L87 Difference]: Start difference. First operand 1949 states and 3228 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:48,933 INFO L93 Difference]: Finished difference Result 4258 states and 7036 transitions. [2023-12-15 23:05:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:05:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2023-12-15 23:05:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:48,942 INFO L225 Difference]: With dead ends: 4258 [2023-12-15 23:05:48,942 INFO L226 Difference]: Without dead ends: 2413 [2023-12-15 23:05:48,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:48,946 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:48,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2023-12-15 23:05:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2233. [2023-12-15 23:05:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1814 states have (on average 1.456449834619625) internal successors, (2642), 1895 states have internal predecessors, (2642), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-12-15 23:05:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3639 transitions. [2023-12-15 23:05:49,029 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3639 transitions. Word has length 94 [2023-12-15 23:05:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:49,029 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3639 transitions. [2023-12-15 23:05:49,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3639 transitions. [2023-12-15 23:05:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 23:05:49,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:49,035 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:49,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:49,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:49,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:49,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 236030838, now seen corresponding path program 1 times [2023-12-15 23:05:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971250710] [2023-12-15 23:05:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 23:05:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 23:05:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:05:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 23:05:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:05:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:05:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:05:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971250710] [2023-12-15 23:05:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971250710] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046686156] [2023-12-15 23:05:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:49,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 23:05:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 23:05:49,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-15 23:05:49,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046686156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-15 23:05:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661188817] [2023-12-15 23:05:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:49,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:05:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:05:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:05:49,447 INFO L87 Difference]: Start difference. First operand 2233 states and 3639 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:49,517 INFO L93 Difference]: Finished difference Result 4334 states and 7049 transitions. [2023-12-15 23:05:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:05:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-15 23:05:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:49,525 INFO L225 Difference]: With dead ends: 4334 [2023-12-15 23:05:49,525 INFO L226 Difference]: Without dead ends: 2297 [2023-12-15 23:05:49,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:05:49,530 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:49,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2023-12-15 23:05:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2265. [2023-12-15 23:05:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1846 states have (on average 1.448537378114843) internal successors, (2674), 1927 states have internal predecessors, (2674), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-12-15 23:05:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3671 transitions. [2023-12-15 23:05:49,604 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3671 transitions. Word has length 94 [2023-12-15 23:05:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:49,605 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 3671 transitions. [2023-12-15 23:05:49,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3671 transitions. [2023-12-15 23:05:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 23:05:49,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:49,611 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:49,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-15 23:05:49,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-15 23:05:49,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:49,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1971241955, now seen corresponding path program 1 times [2023-12-15 23:05:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074331051] [2023-12-15 23:05:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 23:05:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 23:05:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 23:05:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 23:05:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 23:05:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 23:05:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 23:05:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:49,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074331051] [2023-12-15 23:05:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074331051] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991126078] [2023-12-15 23:05:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:49,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:49,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:49,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 23:05:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:49,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:05:50,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 23:05:50,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991126078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-15 23:05:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864665066] [2023-12-15 23:05:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:05:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:05:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:50,018 INFO L87 Difference]: Start difference. First operand 2265 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:50,088 INFO L93 Difference]: Finished difference Result 4634 states and 7890 transitions. [2023-12-15 23:05:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:05:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-12-15 23:05:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:50,097 INFO L225 Difference]: With dead ends: 4634 [2023-12-15 23:05:50,097 INFO L226 Difference]: Without dead ends: 2549 [2023-12-15 23:05:50,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:50,102 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:50,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-12-15 23:05:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2023-12-15 23:05:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2034 states have (on average 1.4267453294001966) internal successors, (2902), 2115 states have internal predecessors, (2902), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2023-12-15 23:05:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4221 transitions. [2023-12-15 23:05:50,189 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4221 transitions. Word has length 96 [2023-12-15 23:05:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:50,189 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 4221 transitions. [2023-12-15 23:05:50,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4221 transitions. [2023-12-15 23:05:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 23:05:50,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:50,197 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:50,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 23:05:50,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:50,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1181222875, now seen corresponding path program 1 times [2023-12-15 23:05:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384944689] [2023-12-15 23:05:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 23:05:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 23:05:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 23:05:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 23:05:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 23:05:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 23:05:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 23:05:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384944689] [2023-12-15 23:05:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384944689] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812209666] [2023-12-15 23:05:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:50,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:50,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:50,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:50,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 23:05:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:50,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:50,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:05:50,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812209666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-15 23:05:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817107206] [2023-12-15 23:05:50,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:50,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:50,643 INFO L87 Difference]: Start difference. First operand 2549 states and 4221 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:50,870 INFO L93 Difference]: Finished difference Result 7898 states and 13749 transitions. [2023-12-15 23:05:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:05:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-12-15 23:05:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:50,890 INFO L225 Difference]: With dead ends: 7898 [2023-12-15 23:05:50,890 INFO L226 Difference]: Without dead ends: 5577 [2023-12-15 23:05:50,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:50,897 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 183 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:50,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 576 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-12-15 23:05:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5493. [2023-12-15 23:05:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4254937163375225) internal successors, (6352), 4723 states have internal predecessors, (6352), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-12-15 23:05:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9389 transitions. [2023-12-15 23:05:51,158 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9389 transitions. Word has length 96 [2023-12-15 23:05:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:51,158 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9389 transitions. [2023-12-15 23:05:51,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9389 transitions. [2023-12-15 23:05:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 23:05:51,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:51,175 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:51,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:51,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 23:05:51,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:51,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1860495129, now seen corresponding path program 1 times [2023-12-15 23:05:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:51,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363217622] [2023-12-15 23:05:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 23:05:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 23:05:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 23:05:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 23:05:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 23:05:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 23:05:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 23:05:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 23:05:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 23:05:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:05:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363217622] [2023-12-15 23:05:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363217622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198877437] [2023-12-15 23:05:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:51,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:51,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:51,484 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:51,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 23:05:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:51,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 23:05:51,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:51,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198877437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64240558] [2023-12-15 23:05:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:51,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:51,628 INFO L87 Difference]: Start difference. First operand 5493 states and 9389 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:51,842 INFO L93 Difference]: Finished difference Result 11994 states and 20213 transitions. [2023-12-15 23:05:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2023-12-15 23:05:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:51,878 INFO L225 Difference]: With dead ends: 11994 [2023-12-15 23:05:51,879 INFO L226 Difference]: Without dead ends: 6727 [2023-12-15 23:05:51,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:05:51,892 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:51,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 304 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2023-12-15 23:05:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5493. [2023-12-15 23:05:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4252692998204668) internal successors, (6351), 4723 states have internal predecessors, (6351), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-12-15 23:05:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9388 transitions. [2023-12-15 23:05:52,168 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9388 transitions. Word has length 96 [2023-12-15 23:05:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:52,168 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9388 transitions. [2023-12-15 23:05:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9388 transitions. [2023-12-15 23:05:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:05:52,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:52,190 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:52,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:52,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 23:05:52,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:52,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash -315091207, now seen corresponding path program 1 times [2023-12-15 23:05:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:52,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558960356] [2023-12-15 23:05:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 23:05:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 23:05:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 23:05:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 23:05:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 23:05:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 23:05:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 23:05:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 23:05:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 23:05:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558960356] [2023-12-15 23:05:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558960356] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119007267] [2023-12-15 23:05:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:52,502 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:52,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-15 23:05:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:52,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:05:52,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 23:05:52,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119007267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:52,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-15 23:05:52,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271967409] [2023-12-15 23:05:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:05:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:05:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:52,591 INFO L87 Difference]: Start difference. First operand 5493 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:52,765 INFO L93 Difference]: Finished difference Result 10940 states and 19073 transitions. [2023-12-15 23:05:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:05:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2023-12-15 23:05:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:52,790 INFO L225 Difference]: With dead ends: 10940 [2023-12-15 23:05:52,790 INFO L226 Difference]: Without dead ends: 5853 [2023-12-15 23:05:52,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:52,804 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:52,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2023-12-15 23:05:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2023-12-15 23:05:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.416025641025641) internal successors, (6627), 4939 states have internal predecessors, (6627), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-12-15 23:05:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10120 transitions. [2023-12-15 23:05:53,103 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10120 transitions. Word has length 97 [2023-12-15 23:05:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10120 transitions. [2023-12-15 23:05:53,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10120 transitions. [2023-12-15 23:05:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:05:53,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:53,132 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:53,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:53,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 23:05:53,336 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:53,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1457593673, now seen corresponding path program 1 times [2023-12-15 23:05:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990387111] [2023-12-15 23:05:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 23:05:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 23:05:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 23:05:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 23:05:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 23:05:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 23:05:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 23:05:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 23:05:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 23:05:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990387111] [2023-12-15 23:05:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990387111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930444548] [2023-12-15 23:05:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:53,429 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:53,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-15 23:05:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:53,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 23:05:53,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 23:05:53,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930444548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:05:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297864584] [2023-12-15 23:05:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:53,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:53,541 INFO L87 Difference]: Start difference. First operand 5853 states and 10120 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:53,799 INFO L93 Difference]: Finished difference Result 12398 states and 21091 transitions. [2023-12-15 23:05:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2023-12-15 23:05:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:53,820 INFO L225 Difference]: With dead ends: 12398 [2023-12-15 23:05:53,820 INFO L226 Difference]: Without dead ends: 6807 [2023-12-15 23:05:53,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:05:53,833 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:53,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2023-12-15 23:05:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5853. [2023-12-15 23:05:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.4151709401709403) internal successors, (6623), 4939 states have internal predecessors, (6623), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-12-15 23:05:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10116 transitions. [2023-12-15 23:05:54,069 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10116 transitions. Word has length 97 [2023-12-15 23:05:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:54,069 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10116 transitions. [2023-12-15 23:05:54,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10116 transitions. [2023-12-15 23:05:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:05:54,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:54,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:54,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:54,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-15 23:05:54,289 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:54,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1091145433, now seen corresponding path program 1 times [2023-12-15 23:05:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690704797] [2023-12-15 23:05:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 23:05:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:05:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690704797] [2023-12-15 23:05:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690704797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796249352] [2023-12-15 23:05:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:54,425 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:54,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-15 23:05:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:54,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:05:54,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 23:05:54,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796249352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-15 23:05:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799280885] [2023-12-15 23:05:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:54,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:05:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:05:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:54,524 INFO L87 Difference]: Start difference. First operand 5853 states and 10116 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:54,703 INFO L93 Difference]: Finished difference Result 11856 states and 20687 transitions. [2023-12-15 23:05:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:05:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-12-15 23:05:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:54,723 INFO L225 Difference]: With dead ends: 11856 [2023-12-15 23:05:54,723 INFO L226 Difference]: Without dead ends: 6465 [2023-12-15 23:05:54,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:54,733 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:54,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 235 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-12-15 23:05:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 6465. [2023-12-15 23:05:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6465 states, 5076 states have (on average 1.3977541371158393) internal successors, (7095), 5335 states have internal predecessors, (7095), 721 states have call successors, (721), 377 states have call predecessors, (721), 667 states have return successors, (3444), 816 states have call predecessors, (3444), 721 states have call successors, (3444) [2023-12-15 23:05:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 11260 transitions. [2023-12-15 23:05:55,013 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 11260 transitions. Word has length 99 [2023-12-15 23:05:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:55,013 INFO L495 AbstractCegarLoop]: Abstraction has 6465 states and 11260 transitions. [2023-12-15 23:05:55,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 11260 transitions. [2023-12-15 23:05:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:05:55,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:55,031 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:55,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:55,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:55,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1930179095, now seen corresponding path program 1 times [2023-12-15 23:05:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229601742] [2023-12-15 23:05:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 23:05:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:05:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229601742] [2023-12-15 23:05:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229601742] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430134256] [2023-12-15 23:05:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:55,329 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:55,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-15 23:05:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:55,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:55,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:05:55,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430134256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-15 23:05:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340094726] [2023-12-15 23:05:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:55,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:55,449 INFO L87 Difference]: Start difference. First operand 6465 states and 11260 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:55,800 INFO L93 Difference]: Finished difference Result 12480 states and 20997 transitions. [2023-12-15 23:05:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:05:55,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-12-15 23:05:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:55,821 INFO L225 Difference]: With dead ends: 12480 [2023-12-15 23:05:55,821 INFO L226 Difference]: Without dead ends: 6565 [2023-12-15 23:05:55,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:55,833 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:55,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 547 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2023-12-15 23:05:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 6561. [2023-12-15 23:05:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 5148 states have (on average 1.385975135975136) internal successors, (7135), 5431 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-15 23:05:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 10872 transitions. [2023-12-15 23:05:56,171 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 10872 transitions. Word has length 99 [2023-12-15 23:05:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:56,171 INFO L495 AbstractCegarLoop]: Abstraction has 6561 states and 10872 transitions. [2023-12-15 23:05:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 10872 transitions. [2023-12-15 23:05:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:05:56,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:56,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:56,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-15 23:05:56,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-15 23:05:56,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:56,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash -96433003, now seen corresponding path program 2 times [2023-12-15 23:05:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731297222] [2023-12-15 23:05:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 23:05:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:05:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731297222] [2023-12-15 23:05:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731297222] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468984832] [2023-12-15 23:05:56,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 23:05:56,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:56,478 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:56,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-15 23:05:56,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-15 23:05:56,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 23:05:56,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 23:05:56,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-15 23:05:56,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468984832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:56,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:56,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-15 23:05:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511380285] [2023-12-15 23:05:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:56,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:05:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:05:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:05:56,589 INFO L87 Difference]: Start difference. First operand 6561 states and 10872 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-15 23:05:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:56,777 INFO L93 Difference]: Finished difference Result 8221 states and 15175 transitions. [2023-12-15 23:05:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:05:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-12-15 23:05:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:56,805 INFO L225 Difference]: With dead ends: 8221 [2023-12-15 23:05:56,806 INFO L226 Difference]: Without dead ends: 8217 [2023-12-15 23:05:56,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:56,811 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:56,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 447 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-12-15 23:05:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6689. [2023-12-15 23:05:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5276 states have (on average 1.3766110689916604) internal successors, (7263), 5559 states have internal predecessors, (7263), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-15 23:05:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 11000 transitions. [2023-12-15 23:05:57,126 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 11000 transitions. Word has length 99 [2023-12-15 23:05:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:57,126 INFO L495 AbstractCegarLoop]: Abstraction has 6689 states and 11000 transitions. [2023-12-15 23:05:57,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-15 23:05:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 11000 transitions. [2023-12-15 23:05:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:05:57,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:57,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:57,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:57,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-15 23:05:57,346 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:57,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -39174701, now seen corresponding path program 1 times [2023-12-15 23:05:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535172187] [2023-12-15 23:05:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 23:05:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:05:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 23:05:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535172187] [2023-12-15 23:05:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535172187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751559544] [2023-12-15 23:05:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:57,443 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:57,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-15 23:05:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:57,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 23:05:57,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-15 23:05:57,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:57,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751559544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:57,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:57,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-15 23:05:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331680734] [2023-12-15 23:05:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:57,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:05:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:05:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:05:57,608 INFO L87 Difference]: Start difference. First operand 6689 states and 11000 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-15 23:05:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:57,827 INFO L93 Difference]: Finished difference Result 12748 states and 20399 transitions. [2023-12-15 23:05:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-12-15 23:05:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:57,843 INFO L225 Difference]: With dead ends: 12748 [2023-12-15 23:05:57,844 INFO L226 Difference]: Without dead ends: 6625 [2023-12-15 23:05:57,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:57,852 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:57,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:05:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2023-12-15 23:05:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2023-12-15 23:05:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5212 states have (on average 1.3689562547966232) internal successors, (7135), 5495 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-15 23:05:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10872 transitions. [2023-12-15 23:05:58,157 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10872 transitions. Word has length 99 [2023-12-15 23:05:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:58,157 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10872 transitions. [2023-12-15 23:05:58,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-15 23:05:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10872 transitions. [2023-12-15 23:05:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 23:05:58,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:58,175 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:58,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:58,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-15 23:05:58,378 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:58,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 871855670, now seen corresponding path program 1 times [2023-12-15 23:05:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719053553] [2023-12-15 23:05:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 23:05:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 23:05:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 23:05:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719053553] [2023-12-15 23:05:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719053553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293456567] [2023-12-15 23:05:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:58,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:58,456 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:58,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-15 23:05:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:58,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:05:58,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:05:58,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293456567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-15 23:05:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844378367] [2023-12-15 23:05:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:58,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:05:58,593 INFO L87 Difference]: Start difference. First operand 6625 states and 10872 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:58,928 INFO L93 Difference]: Finished difference Result 12940 states and 20614 transitions. [2023-12-15 23:05:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:05:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2023-12-15 23:05:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:05:58,944 INFO L225 Difference]: With dead ends: 12940 [2023-12-15 23:05:58,944 INFO L226 Difference]: Without dead ends: 6845 [2023-12-15 23:05:58,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:05:58,955 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 192 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:05:58,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 570 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:05:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-12-15 23:05:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6841. [2023-12-15 23:05:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3492210682492582) internal successors, (7275), 5711 states have internal predecessors, (7275), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-12-15 23:05:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10652 transitions. [2023-12-15 23:05:59,297 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10652 transitions. Word has length 102 [2023-12-15 23:05:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:05:59,297 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10652 transitions. [2023-12-15 23:05:59,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:05:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10652 transitions. [2023-12-15 23:05:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 23:05:59,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:05:59,315 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:05:59,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-15 23:05:59,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:59,519 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:05:59,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:05:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash -814324168, now seen corresponding path program 1 times [2023-12-15 23:05:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:05:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837512261] [2023-12-15 23:05:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:05:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:05:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 23:05:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 23:05:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 23:05:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 23:05:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 23:05:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:05:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:05:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 23:05:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 23:05:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 23:05:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:05:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837512261] [2023-12-15 23:05:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837512261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:05:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286392794] [2023-12-15 23:05:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:05:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:05:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:05:59,610 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:05:59,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-15 23:05:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:05:59,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 23:05:59,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:05:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-15 23:05:59,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:05:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286392794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:05:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:05:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-12-15 23:05:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290336787] [2023-12-15 23:05:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:05:59,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:05:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:05:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:05:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:05:59,725 INFO L87 Difference]: Start difference. First operand 6841 states and 10652 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:05:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:05:59,994 INFO L93 Difference]: Finished difference Result 14070 states and 21801 transitions. [2023-12-15 23:05:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:05:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2023-12-15 23:05:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:00,011 INFO L225 Difference]: With dead ends: 14070 [2023-12-15 23:06:00,012 INFO L226 Difference]: Without dead ends: 7543 [2023-12-15 23:06:00,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:00,021 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2023-12-15 23:06:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 6841. [2023-12-15 23:06:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3477373887240356) internal successors, (7267), 5711 states have internal predecessors, (7267), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-12-15 23:06:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10644 transitions. [2023-12-15 23:06:00,329 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10644 transitions. Word has length 102 [2023-12-15 23:06:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:00,329 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10644 transitions. [2023-12-15 23:06:00,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:06:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10644 transitions. [2023-12-15 23:06:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 23:06:00,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:00,341 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:00,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:00,546 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:00,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1864122538, now seen corresponding path program 1 times [2023-12-15 23:06:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843273144] [2023-12-15 23:06:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 23:06:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:06:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:06:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 23:06:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 23:06:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843273144] [2023-12-15 23:06:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843273144] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629155118] [2023-12-15 23:06:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:00,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:00,626 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-15 23:06:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:00,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:00,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 23:06:00,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629155118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-12-15 23:06:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904216868] [2023-12-15 23:06:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:06:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:06:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:06:00,723 INFO L87 Difference]: Start difference. First operand 6841 states and 10644 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:00,924 INFO L93 Difference]: Finished difference Result 14110 states and 21908 transitions. [2023-12-15 23:06:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:06:00,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-12-15 23:06:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:00,942 INFO L225 Difference]: With dead ends: 14110 [2023-12-15 23:06:00,942 INFO L226 Difference]: Without dead ends: 7803 [2023-12-15 23:06:00,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:06:00,952 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:00,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2023-12-15 23:06:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7803. [2023-12-15 23:06:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 6030 states have (on average 1.3203980099502488) internal successors, (7962), 6349 states have internal predecessors, (7962), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3180), 1032 states have call predecessors, (3180), 937 states have call successors, (3180) [2023-12-15 23:06:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 12079 transitions. [2023-12-15 23:06:01,304 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 12079 transitions. Word has length 104 [2023-12-15 23:06:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:01,305 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 12079 transitions. [2023-12-15 23:06:01,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 12079 transitions. [2023-12-15 23:06:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 23:06:01,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:01,320 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:01,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-15 23:06:01,525 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:01,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 721620072, now seen corresponding path program 1 times [2023-12-15 23:06:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486543670] [2023-12-15 23:06:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 23:06:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:06:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:06:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 23:06:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 23:06:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486543670] [2023-12-15 23:06:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486543670] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182220539] [2023-12-15 23:06:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:01,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:01,615 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:01,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-15 23:06:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:01,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 23:06:01,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:01,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182220539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-12-15 23:06:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026998477] [2023-12-15 23:06:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:01,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:01,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:01,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:01,741 INFO L87 Difference]: Start difference. First operand 7803 states and 12079 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:02,067 INFO L93 Difference]: Finished difference Result 15114 states and 22661 transitions. [2023-12-15 23:06:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 23:06:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-12-15 23:06:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:02,085 INFO L225 Difference]: With dead ends: 15114 [2023-12-15 23:06:02,085 INFO L226 Difference]: Without dead ends: 7969 [2023-12-15 23:06:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:06:02,097 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 173 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:02,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 508 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2023-12-15 23:06:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7965. [2023-12-15 23:06:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 6138 states have (on average 1.30514825676116) internal successors, (8011), 6511 states have internal predecessors, (8011), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2884), 1032 states have call predecessors, (2884), 937 states have call successors, (2884) [2023-12-15 23:06:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 11832 transitions. [2023-12-15 23:06:02,509 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 11832 transitions. Word has length 104 [2023-12-15 23:06:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:02,509 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 11832 transitions. [2023-12-15 23:06:02,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 11832 transitions. [2023-12-15 23:06:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 23:06:02,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:02,526 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:02,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:02,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-15 23:06:02,731 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:02,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1400892326, now seen corresponding path program 1 times [2023-12-15 23:06:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621493016] [2023-12-15 23:06:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 23:06:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:06:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:06:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 23:06:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 23:06:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621493016] [2023-12-15 23:06:02,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621493016] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594952860] [2023-12-15 23:06:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:02,811 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:02,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-15 23:06:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:02,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 23:06:02,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-15 23:06:02,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594952860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-12-15 23:06:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76076227] [2023-12-15 23:06:02,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:06:02,921 INFO L87 Difference]: Start difference. First operand 7965 states and 11832 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:03,148 INFO L93 Difference]: Finished difference Result 12501 states and 18133 transitions. [2023-12-15 23:06:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:06:03,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-12-15 23:06:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:03,160 INFO L225 Difference]: With dead ends: 12501 [2023-12-15 23:06:03,160 INFO L226 Difference]: Without dead ends: 5086 [2023-12-15 23:06:03,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:03,170 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:03,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 449 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2023-12-15 23:06:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 5086. [2023-12-15 23:06:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 3894 states have (on average 1.29301489470981) internal successors, (5035), 4148 states have internal predecessors, (5035), 609 states have call successors, (609), 313 states have call predecessors, (609), 582 states have return successors, (1692), 656 states have call predecessors, (1692), 609 states have call successors, (1692) [2023-12-15 23:06:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 7336 transitions. [2023-12-15 23:06:03,351 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 7336 transitions. Word has length 104 [2023-12-15 23:06:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:03,351 INFO L495 AbstractCegarLoop]: Abstraction has 5086 states and 7336 transitions. [2023-12-15 23:06:03,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 23:06:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 7336 transitions. [2023-12-15 23:06:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 23:06:03,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:03,360 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:03,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:03,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:03,565 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:03,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash 93749928, now seen corresponding path program 1 times [2023-12-15 23:06:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984267406] [2023-12-15 23:06:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 23:06:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 23:06:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 23:06:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 23:06:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 23:06:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984267406] [2023-12-15 23:06:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984267406] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143936238] [2023-12-15 23:06:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:03,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:03,678 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:03,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-15 23:06:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:03,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 23:06:03,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-15 23:06:03,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143936238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 23:06:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152071930] [2023-12-15 23:06:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:03,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:06:03,834 INFO L87 Difference]: Start difference. First operand 5086 states and 7336 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:06:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:04,109 INFO L93 Difference]: Finished difference Result 9622 states and 13549 transitions. [2023-12-15 23:06:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:06:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2023-12-15 23:06:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:04,118 INFO L225 Difference]: With dead ends: 9622 [2023-12-15 23:06:04,118 INFO L226 Difference]: Without dead ends: 4805 [2023-12-15 23:06:04,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:06:04,124 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:04,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2023-12-15 23:06:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 4805. [2023-12-15 23:06:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 3769 states have (on average 1.2963650835765455) internal successors, (4886), 4007 states have internal predecessors, (4886), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6739 transitions. [2023-12-15 23:06:04,358 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6739 transitions. Word has length 104 [2023-12-15 23:06:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:04,359 INFO L495 AbstractCegarLoop]: Abstraction has 4805 states and 6739 transitions. [2023-12-15 23:06:04,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 23:06:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6739 transitions. [2023-12-15 23:06:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 23:06:04,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:04,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:04,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:04,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:04,571 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:04,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1932596493, now seen corresponding path program 1 times [2023-12-15 23:06:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909685049] [2023-12-15 23:06:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 23:06:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 23:06:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 23:06:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 23:06:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 23:06:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 23:06:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909685049] [2023-12-15 23:06:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909685049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154622681] [2023-12-15 23:06:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:04,715 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:04,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-15 23:06:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:04,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 23:06:04,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:04,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154622681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 23:06:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796263754] [2023-12-15 23:06:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:04,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:06:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:06:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:04,813 INFO L87 Difference]: Start difference. First operand 4805 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:05,002 INFO L93 Difference]: Finished difference Result 9421 states and 13096 transitions. [2023-12-15 23:06:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:06:05,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2023-12-15 23:06:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:05,011 INFO L225 Difference]: With dead ends: 9421 [2023-12-15 23:06:05,012 INFO L226 Difference]: Without dead ends: 4885 [2023-12-15 23:06:05,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:05,018 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:05,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2023-12-15 23:06:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4853. [2023-12-15 23:06:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.292638197537333) internal successors, (4934), 4055 states have internal predecessors, (4934), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6787 transitions. [2023-12-15 23:06:05,194 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6787 transitions. Word has length 117 [2023-12-15 23:06:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:05,194 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6787 transitions. [2023-12-15 23:06:05,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6787 transitions. [2023-12-15 23:06:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 23:06:05,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:05,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:05,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-15 23:06:05,406 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:05,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash -256404888, now seen corresponding path program 1 times [2023-12-15 23:06:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401278537] [2023-12-15 23:06:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 23:06:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 23:06:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 23:06:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:06:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 23:06:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 23:06:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401278537] [2023-12-15 23:06:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401278537] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531425514] [2023-12-15 23:06:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:05,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:05,546 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:05,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-15 23:06:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:05,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:05,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:05,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531425514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:05,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 23:06:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273110361] [2023-12-15 23:06:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:06:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:05,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:06:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:05,631 INFO L87 Difference]: Start difference. First operand 4853 states and 6787 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:05,762 INFO L93 Difference]: Finished difference Result 9453 states and 13064 transitions. [2023-12-15 23:06:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:06:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2023-12-15 23:06:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:05,771 INFO L225 Difference]: With dead ends: 9453 [2023-12-15 23:06:05,771 INFO L226 Difference]: Without dead ends: 4869 [2023-12-15 23:06:05,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:05,776 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2023-12-15 23:06:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4853. [2023-12-15 23:06:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2800628766046633) internal successors, (4886), 4055 states have internal predecessors, (4886), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6739 transitions. [2023-12-15 23:06:05,987 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6739 transitions. Word has length 118 [2023-12-15 23:06:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:05,987 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6739 transitions. [2023-12-15 23:06:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6739 transitions. [2023-12-15 23:06:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 23:06:05,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:05,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:05,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-15 23:06:06,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-15 23:06:06,198 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:06,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1470067273, now seen corresponding path program 1 times [2023-12-15 23:06:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362226178] [2023-12-15 23:06:06,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 23:06:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 23:06:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 23:06:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 23:06:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 23:06:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 23:06:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362226178] [2023-12-15 23:06:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362226178] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900356610] [2023-12-15 23:06:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:06,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:06,309 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:06,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-15 23:06:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:06,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:06,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:06,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900356610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-12-15 23:06:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008012001] [2023-12-15 23:06:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:06,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:06:06,479 INFO L87 Difference]: Start difference. First operand 4853 states and 6739 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:06,641 INFO L93 Difference]: Finished difference Result 9437 states and 12952 transitions. [2023-12-15 23:06:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:06:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 118 [2023-12-15 23:06:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:06,652 INFO L225 Difference]: With dead ends: 9437 [2023-12-15 23:06:06,652 INFO L226 Difference]: Without dead ends: 4853 [2023-12-15 23:06:06,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:06:06,658 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 210 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:06,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 120 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2023-12-15 23:06:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4853. [2023-12-15 23:06:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2758711029604402) internal successors, (4870), 4055 states have internal predecessors, (4870), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6723 transitions. [2023-12-15 23:06:06,835 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6723 transitions. Word has length 118 [2023-12-15 23:06:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:06,836 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6723 transitions. [2023-12-15 23:06:06,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6723 transitions. [2023-12-15 23:06:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 23:06:06,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:06,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:06,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:07,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-15 23:06:07,048 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:07,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1106088414, now seen corresponding path program 1 times [2023-12-15 23:06:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879705302] [2023-12-15 23:06:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:06:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:06:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:06:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 23:06:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 23:06:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 23:06:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:07,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879705302] [2023-12-15 23:06:07,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879705302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172488611] [2023-12-15 23:06:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:07,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:07,194 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:07,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-15 23:06:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:07,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:07,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172488611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-12-15 23:06:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824900823] [2023-12-15 23:06:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:06:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:06:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:06:07,283 INFO L87 Difference]: Start difference. First operand 4853 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:07,425 INFO L93 Difference]: Finished difference Result 9613 states and 13176 transitions. [2023-12-15 23:06:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:06:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2023-12-15 23:06:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:07,434 INFO L225 Difference]: With dead ends: 9613 [2023-12-15 23:06:07,435 INFO L226 Difference]: Without dead ends: 5029 [2023-12-15 23:06:07,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:06:07,440 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:07,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2023-12-15 23:06:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 4965. [2023-12-15 23:06:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 3929 states have (on average 1.2761516925426317) internal successors, (5014), 4167 states have internal predecessors, (5014), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6867 transitions. [2023-12-15 23:06:07,620 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6867 transitions. Word has length 119 [2023-12-15 23:06:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:07,621 INFO L495 AbstractCegarLoop]: Abstraction has 4965 states and 6867 transitions. [2023-12-15 23:06:07,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 23:06:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6867 transitions. [2023-12-15 23:06:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 23:06:07,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:07,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:07,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:07,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-15 23:06:07,833 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:07,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1160481312, now seen corresponding path program 1 times [2023-12-15 23:06:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622270674] [2023-12-15 23:06:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 23:06:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 23:06:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 23:06:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 23:06:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 23:06:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 23:06:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622270674] [2023-12-15 23:06:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622270674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011095364] [2023-12-15 23:06:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:07,988 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:08,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-15 23:06:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:08,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:08,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011095364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-15 23:06:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010577112] [2023-12-15 23:06:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:08,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:08,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:08,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:08,184 INFO L87 Difference]: Start difference. First operand 4965 states and 6867 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:08,395 INFO L93 Difference]: Finished difference Result 9661 states and 13208 transitions. [2023-12-15 23:06:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:06:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 119 [2023-12-15 23:06:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:08,404 INFO L225 Difference]: With dead ends: 9661 [2023-12-15 23:06:08,404 INFO L226 Difference]: Without dead ends: 4965 [2023-12-15 23:06:08,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:08,411 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 213 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:08,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4965 states. [2023-12-15 23:06:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4965 to 4965. [2023-12-15 23:06:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 3929 states have (on average 1.2680071264952915) internal successors, (4982), 4167 states have internal predecessors, (4982), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6835 transitions. [2023-12-15 23:06:08,605 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6835 transitions. Word has length 119 [2023-12-15 23:06:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:08,605 INFO L495 AbstractCegarLoop]: Abstraction has 4965 states and 6835 transitions. [2023-12-15 23:06:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6835 transitions. [2023-12-15 23:06:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 23:06:08,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:08,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:08,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:08,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-15 23:06:08,817 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:08,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash -19799755, now seen corresponding path program 1 times [2023-12-15 23:06:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800708382] [2023-12-15 23:06:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 23:06:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 23:06:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 23:06:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 23:06:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 23:06:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 23:06:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800708382] [2023-12-15 23:06:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800708382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167899910] [2023-12-15 23:06:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:08,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:08,970 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:09,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-15 23:06:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:09,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:09,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167899910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:09,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-15 23:06:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763424304] [2023-12-15 23:06:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:09,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:09,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:09,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:09,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:09,135 INFO L87 Difference]: Start difference. First operand 4965 states and 6835 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:09,312 INFO L93 Difference]: Finished difference Result 9549 states and 13016 transitions. [2023-12-15 23:06:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:06:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 120 [2023-12-15 23:06:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:09,321 INFO L225 Difference]: With dead ends: 9549 [2023-12-15 23:06:09,321 INFO L226 Difference]: Without dead ends: 4853 [2023-12-15 23:06:09,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:09,327 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:09,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 116 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:06:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2023-12-15 23:06:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4853. [2023-12-15 23:06:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2632957820277706) internal successors, (4822), 4055 states have internal predecessors, (4822), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-15 23:06:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6675 transitions. [2023-12-15 23:06:09,524 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6675 transitions. Word has length 120 [2023-12-15 23:06:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:09,524 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6675 transitions. [2023-12-15 23:06:09,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6675 transitions. [2023-12-15 23:06:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 23:06:09,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:09,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:09,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-15 23:06:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:09,736 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:09,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2064059006, now seen corresponding path program 1 times [2023-12-15 23:06:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351836000] [2023-12-15 23:06:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:06:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 23:06:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 23:06:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 23:06:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-15 23:06:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351836000] [2023-12-15 23:06:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351836000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:06:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:06:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759173183] [2023-12-15 23:06:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:09,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 23:06:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 23:06:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 23:06:09,844 INFO L87 Difference]: Start difference. First operand 4853 states and 6675 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:10,385 INFO L93 Difference]: Finished difference Result 9805 states and 13328 transitions. [2023-12-15 23:06:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 23:06:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-12-15 23:06:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:10,396 INFO L225 Difference]: With dead ends: 9805 [2023-12-15 23:06:10,396 INFO L226 Difference]: Without dead ends: 5221 [2023-12-15 23:06:10,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:06:10,401 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:10,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 225 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:06:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2023-12-15 23:06:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4945. [2023-12-15 23:06:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 3893 states have (on average 1.25815566401233) internal successors, (4898), 4147 states have internal predecessors, (4898), 469 states have call successors, (469), 313 states have call predecessors, (469), 582 states have return successors, (1388), 500 states have call predecessors, (1388), 469 states have call successors, (1388) [2023-12-15 23:06:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6755 transitions. [2023-12-15 23:06:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6755 transitions. Word has length 121 [2023-12-15 23:06:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:10,594 INFO L495 AbstractCegarLoop]: Abstraction has 4945 states and 6755 transitions. [2023-12-15 23:06:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6755 transitions. [2023-12-15 23:06:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 23:06:10,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:10,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 23:06:10,601 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1670208512, now seen corresponding path program 1 times [2023-12-15 23:06:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182127696] [2023-12-15 23:06:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 23:06:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 23:06:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 23:06:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 23:06:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182127696] [2023-12-15 23:06:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182127696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:06:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:06:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675440426] [2023-12-15 23:06:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:10,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:06:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:06:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:06:10,682 INFO L87 Difference]: Start difference. First operand 4945 states and 6755 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:11,329 INFO L93 Difference]: Finished difference Result 11585 states and 16680 transitions. [2023-12-15 23:06:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:06:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-12-15 23:06:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:11,342 INFO L225 Difference]: With dead ends: 11585 [2023-12-15 23:06:11,343 INFO L226 Difference]: Without dead ends: 6909 [2023-12-15 23:06:11,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-15 23:06:11,350 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 270 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:11,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 365 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:06:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2023-12-15 23:06:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6201. [2023-12-15 23:06:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6201 states, 4961 states have (on average 1.2832090304374117) internal successors, (6366), 5323 states have internal predecessors, (6366), 517 states have call successors, (517), 361 states have call predecessors, (517), 722 states have return successors, (2204), 532 states have call predecessors, (2204), 517 states have call successors, (2204) [2023-12-15 23:06:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 9087 transitions. [2023-12-15 23:06:11,690 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 9087 transitions. Word has length 121 [2023-12-15 23:06:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:11,690 INFO L495 AbstractCegarLoop]: Abstraction has 6201 states and 9087 transitions. [2023-12-15 23:06:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 9087 transitions. [2023-12-15 23:06:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 23:06:11,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:11,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 23:06:11,707 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:11,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -538832258, now seen corresponding path program 1 times [2023-12-15 23:06:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038442578] [2023-12-15 23:06:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 23:06:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 23:06:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 23:06:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-15 23:06:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038442578] [2023-12-15 23:06:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038442578] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948001820] [2023-12-15 23:06:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:11,901 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-15 23:06:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:11,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 23:06:11,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 23:06:12,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:06:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 23:06:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948001820] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:06:12,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:06:12,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-12-15 23:06:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658411830] [2023-12-15 23:06:12,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:06:12,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 23:06:12,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 23:06:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:12,242 INFO L87 Difference]: Start difference. First operand 6201 states and 9087 transitions. Second operand has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-15 23:06:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:14,106 INFO L93 Difference]: Finished difference Result 16778 states and 24678 transitions. [2023-12-15 23:06:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-15 23:06:14,106 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 123 [2023-12-15 23:06:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:14,126 INFO L225 Difference]: With dead ends: 16778 [2023-12-15 23:06:14,126 INFO L226 Difference]: Without dead ends: 10714 [2023-12-15 23:06:14,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 292 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=735, Invalid=2805, Unknown=0, NotChecked=0, Total=3540 [2023-12-15 23:06:14,140 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2215 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:14,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 381 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 23:06:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10714 states. [2023-12-15 23:06:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10714 to 9614. [2023-12-15 23:06:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 7890 states have (on average 1.2667934093789608) internal successors, (9995), 8382 states have internal predecessors, (9995), 675 states have call successors, (675), 565 states have call predecessors, (675), 1048 states have return successors, (2589), 674 states have call predecessors, (2589), 675 states have call successors, (2589) [2023-12-15 23:06:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 13259 transitions. [2023-12-15 23:06:14,586 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 13259 transitions. Word has length 123 [2023-12-15 23:06:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:14,587 INFO L495 AbstractCegarLoop]: Abstraction has 9614 states and 13259 transitions. [2023-12-15 23:06:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-15 23:06:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 13259 transitions. [2023-12-15 23:06:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 23:06:14,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:06:14,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:14,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-15 23:06:14,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-15 23:06:14,797 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:06:14,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:06:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 742131714, now seen corresponding path program 1 times [2023-12-15 23:06:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:06:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2434249] [2023-12-15 23:06:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:06:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:06:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 23:06:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 23:06:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 23:06:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:06:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 23:06:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 23:06:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 23:06:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 23:06:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 23:06:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 23:06:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-15 23:06:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:06:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2434249] [2023-12-15 23:06:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2434249] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:06:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167887991] [2023-12-15 23:06:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:06:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:06:14,945 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 23:06:14,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-15 23:06:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:06:15,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 23:06:15,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:06:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 23:06:15,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:06:15,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167887991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:06:15,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:06:15,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-15 23:06:15,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737649501] [2023-12-15 23:06:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:06:15,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:06:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:06:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:06:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:15,085 INFO L87 Difference]: Start difference. First operand 9614 states and 13259 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:06:15,266 INFO L93 Difference]: Finished difference Result 12403 states and 16880 transitions. [2023-12-15 23:06:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:06:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-15 23:06:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:06:15,267 INFO L225 Difference]: With dead ends: 12403 [2023-12-15 23:06:15,267 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 23:06:15,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:06:15,279 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 241 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:06:15,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 118 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:06:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 23:06:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 23:06:15,279 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-15 23:06:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 23:06:15,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2023-12-15 23:06:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:06:15,280 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 23:06:15,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:06:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 23:06:15,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 23:06:15,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 23:06:15,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-15 23:06:15,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:06:15,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 23:06:26,597 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (< ~b1_val_t~0 1)) (.cse2 (not (= ~z_val~0 0))) (.cse3 (< ~z_ev~0 2)) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (not (= 0 ~z_val_t~0))) (.cse8 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< 0 ~comp_m1_i~0)) (.cse11 (< ~d0_val~0 ~d0_val_t~0)) (.cse12 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (< ~b0_ev~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= ~b0_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-12-15 23:06:26,598 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~z_ev~0)| ~z_ev~0)) (.cse25 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse2 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= |old(~b0_ev~0)| 0))) (.cse10 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse3 (< 0 |old(~d1_ev~0)|)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse17 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~d1_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse11 (not (= 0 ~z_val_t~0))) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse18 (< |old(~d1_ev~0)| 2)) (.cse19 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16)))) [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-12-15 23:06:26,599 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse20 (= |old(~d1_val~0)| ~d1_val~0)) (.cse21 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse22 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse23 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse24 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse25 (= ~z_val~0 0)) (.cse26 (= |old(~z_ev~0)| ~z_ev~0)) (.cse27 (= |old(~d0_val~0)| ~d0_val~0)) (.cse28 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse29 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse18 (< 0 |old(~b1_ev~0)|)) (.cse5 (< 0 |old(~d1_ev~0)|)) (.cse17 (< 0 |old(~d0_ev~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse20 .cse21 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse22 .cse23 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse24 .cse25 .cse26 .cse27 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse28 .cse29 (= |old(~b0_val~0)| ~b0_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse2 (< ~b1_val_t~0 1)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse4 (not (= |old(~z_val~0)| 0))) (.cse6 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse16 (< |old(~b0_ev~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse20 .cse21 .cse22 (= ~d0_req_up~0 1) .cse23 (= ~b0_val~0 0) .cse24 .cse25 .cse26 .cse27 (= ~d1_req_up~0 1) .cse28 .cse29 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) .cse9 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16)))) [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse20 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse24 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse21 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse22 (= |old(~z_ev~0)| ~z_ev~0)) (.cse23 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< 0 |old(~d1_ev~0)|)) (.cse8 (< 0 |old(~d0_ev~0)|)) (.cse17 (< |old(~d0_ev~0)| 2)) (.cse2 (and .cse20 .cse24 .cse21 .cse22 .cse23)) (.cse25 (< 0 |old(~b1_ev~0)|)) (.cse14 (< |old(~d1_ev~0)| 2)) (.cse19 (not (= ~comp_m1_st~0 0))) (.cse0 (< ~b1_val_t~0 1)) (.cse3 (not (= ~z_val~0 0))) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< |old(~z_ev~0)| 2)) (.cse7 (< ~b0_val_t~0 1)) (.cse9 (not (= 0 ~z_val_t~0))) (.cse10 (< ~d1_val~0 ~d1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 (and .cse20 (= ~b0_ev~0 1) .cse21 .cse22 .cse23) .cse6 .cse7 (not (= |old(~b0_ev~0)| 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 (not (= |old(~b1_ev~0)| 1)) .cse0 .cse3 .cse4 .cse5 .cse6 (and .cse20 .cse24 (= ~b1_ev~0 1) .cse21 .cse22) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 (not (= |old(~d0_ev~0)| 1)) .cse0 (and .cse20 .cse24 (= ~d0_ev~0 1) .cse22 .cse23) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~d1_ev~0)| 1)) .cse15 (and .cse24 .cse21 .cse22 (= ~d1_ev~0 1) .cse23) .cse16)))) [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-12-15 23:06:26,600 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-15 23:06:26,601 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-12-15 23:06:26,602 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 23:06:26,602 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,602 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-12-15 23:06:26,602 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-12-15 23:06:26,602 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-12-15 23:06:26,602 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,602 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-12-15 23:06:26,602 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,602 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,603 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= 1 ~d0_val_t~0)) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~b0_ev~0) .cse11))) [2023-12-15 23:06:26,603 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse18 (= ~comp_m1_st~0 0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 23:06:26,603 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-12-15 23:06:26,604 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-12-15 23:06:26,606 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:06:26,607 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:06:26,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:06:26 BoogieIcfgContainer [2023-12-15 23:06:26,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:06:26,640 INFO L158 Benchmark]: Toolchain (without parser) took 43868.16ms. Allocated memory was 310.4MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 266.7MB in the beginning and 1.1GB in the end (delta: -794.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.51ms. Allocated memory is still 310.4MB. Free memory was 266.7MB in the beginning and 252.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.90ms. Allocated memory is still 310.4MB. Free memory was 252.5MB in the beginning and 250.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 310.4MB. Free memory was 250.5MB in the beginning and 248.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: RCFGBuilder took 341.45ms. Allocated memory is still 310.4MB. Free memory was 248.4MB in the beginning and 226.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-15 23:06:26,640 INFO L158 Benchmark]: TraceAbstraction took 43303.32ms. Allocated memory was 310.4MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 225.8MB in the beginning and 1.1GB in the end (delta: -834.9MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-15 23:06:26,641 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.09ms. Allocated memory is still 194.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.51ms. Allocated memory is still 310.4MB. Free memory was 266.7MB in the beginning and 252.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.90ms. Allocated memory is still 310.4MB. Free memory was 252.5MB in the beginning and 250.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 310.4MB. Free memory was 250.5MB in the beginning and 248.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.45ms. Allocated memory is still 310.4MB. Free memory was 248.4MB in the beginning and 226.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 43303.32ms. Allocated memory was 310.4MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 225.8MB in the beginning and 1.1GB in the end (delta: -834.9MB). Peak memory consumption was 1.2GB. 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 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6047 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6001 mSDsluCounter, 10791 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6807 mSDsCounter, 696 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5788 IncrementalHoareTripleChecker+Invalid, 6484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 696 mSolverCounterUnsat, 3984 mSDtfsCounter, 5788 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4245 GetRequests, 3861 SyntacticMatches, 4 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9614occurred in iteration=33, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 7458 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 10741 PreInvPairs, 11047 NumberOfFragments, 6700 HoareAnnotationTreeSize, 10741 FormulaSimplifications, 7239 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 17 FormulaSimplificationsInter, 37640 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 6679 NumberOfCodeBlocks, 6626 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 6736 ConstructedInterpolants, 0 QuantifiedInterpolants, 15288 SizeOfPredicates, 10 NumberOfNonLiveVariables, 14397 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 66 InterpolantComputations, 33 PerfectInterpolantSequences, 2079/2293 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: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) RESULT: Ultimate proved your program to be correct! [2023-12-15 23:06:26,659 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...