/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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:30:00,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:30:00,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 01:30:00,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:30:00,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:30:00,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:30:00,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:30:00,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:30:00,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:30:00,301 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:30:00,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:30:00,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:30:00,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:30:00,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:30:00,305 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:30:00,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:30:00,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:30:00,305 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:30:00,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:30:00,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:30:00,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:30:00,309 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:30:00,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:30:00,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:30:00,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:30:00,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:30:00,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:30:00,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:30:00,311 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:30:00,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:30:00,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:30:00,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 01:30:00,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:30:00,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:30:00,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:30:00,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:30:00,524 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:30:00,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-19 01:30:01,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:30:01,775 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:30:01,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-19 01:30:01,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30481664a/01b272dae1c3404a8bd87f3c2c5ce55f/FLAGbc91396bb [2023-12-19 01:30:01,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30481664a/01b272dae1c3404a8bd87f3c2c5ce55f [2023-12-19 01:30:01,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:30:01,799 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:30:01,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:30:01,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:30:01,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:30:01,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:01" (1/1) ... [2023-12-19 01:30:01,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ad5a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:01, skipping insertion in model container [2023-12-19 01:30:01,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:01" (1/1) ... [2023-12-19 01:30:01,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:30:01,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2023-12-19 01:30:01,994 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2023-12-19 01:30:02,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:30:02,031 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:30:02,039 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2023-12-19 01:30:02,061 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2023-12-19 01:30:02,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:30:02,092 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:30:02,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02 WrapperNode [2023-12-19 01:30:02,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:30:02,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:30:02,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:30:02,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:30:02,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,136 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 483 [2023-12-19 01:30:02,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:30:02,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:30:02,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:30:02,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:30:02,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 01:30:02,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:30:02,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:30:02,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:30:02,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:30:02,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (1/1) ... [2023-12-19 01:30:02,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:30:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:02,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 01:30:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 01:30:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:30:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:30:02,265 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:30:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-19 01:30:02,266 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-19 01:30:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:30:02,267 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:30:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:30:02,267 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:30:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:30:02,267 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:30:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:30:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:30:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:30:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:30:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:30:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:30:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:30:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:30:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:30:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:30:02,269 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:30:02,355 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:30:02,357 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:30:02,786 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:30:02,825 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:30:02,825 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-19 01:30:02,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:02 BoogieIcfgContainer [2023-12-19 01:30:02,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:30:02,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:30:02,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:30:02,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:30:02,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:30:01" (1/3) ... [2023-12-19 01:30:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5419c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:02, skipping insertion in model container [2023-12-19 01:30:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:02" (2/3) ... [2023-12-19 01:30:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5419c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:02, skipping insertion in model container [2023-12-19 01:30:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:02" (3/3) ... [2023-12-19 01:30:02,832 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-19 01:30:02,847 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:30:02,847 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:30:02,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:30:02,953 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;@27c7f7ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:30:02,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:30:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 01:30:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-19 01:30:02,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:02,967 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] [2023-12-19 01:30:02,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:02,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -641686583, now seen corresponding path program 1 times [2023-12-19 01:30:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851183041] [2023-12-19 01:30:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,230 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-19 01:30:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851183041] [2023-12-19 01:30:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851183041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:03,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:03,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628278801] [2023-12-19 01:30:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:03,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:03,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:03,270 INFO L87 Difference]: Start difference. First operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:03,607 INFO L93 Difference]: Finished difference Result 413 states and 658 transitions. [2023-12-19 01:30:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:03,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-19 01:30:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:03,617 INFO L225 Difference]: With dead ends: 413 [2023-12-19 01:30:03,617 INFO L226 Difference]: Without dead ends: 239 [2023-12-19 01:30:03,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:03,623 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 316 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:03,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 366 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-19 01:30:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2023-12-19 01:30:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4845360824742269) internal successors, (288), 198 states have internal predecessors, (288), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2023-12-19 01:30:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 344 transitions. [2023-12-19 01:30:03,691 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 344 transitions. Word has length 37 [2023-12-19 01:30:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:03,692 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 344 transitions. [2023-12-19 01:30:03,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2023-12-19 01:30:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 01:30:03,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:03,695 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] [2023-12-19 01:30:03,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:30:03,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:03,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1102259478, now seen corresponding path program 1 times [2023-12-19 01:30:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:03,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746116410] [2023-12-19 01:30:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-19 01:30:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:03,777 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-19 01:30:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746116410] [2023-12-19 01:30:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746116410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346586326] [2023-12-19 01:30:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:03,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:03,781 INFO L87 Difference]: Start difference. First operand 233 states and 344 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:03,996 INFO L93 Difference]: Finished difference Result 467 states and 688 transitions. [2023-12-19 01:30:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:03,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-19 01:30:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:04,012 INFO L225 Difference]: With dead ends: 467 [2023-12-19 01:30:04,012 INFO L226 Difference]: Without dead ends: 356 [2023-12-19 01:30:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:04,017 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 329 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:04,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 357 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-19 01:30:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2023-12-19 01:30:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 281 states have (on average 1.4448398576512456) internal successors, (406), 286 states have internal predecessors, (406), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-12-19 01:30:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 484 transitions. [2023-12-19 01:30:04,050 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 484 transitions. Word has length 38 [2023-12-19 01:30:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:04,051 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 484 transitions. [2023-12-19 01:30:04,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 484 transitions. [2023-12-19 01:30:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-19 01:30:04,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:04,057 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-19 01:30:04,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:30:04,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:04,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash -45404508, now seen corresponding path program 1 times [2023-12-19 01:30:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:04,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440758431] [2023-12-19 01:30:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-19 01:30:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,127 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-19 01:30:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440758431] [2023-12-19 01:30:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440758431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:04,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894833006] [2023-12-19 01:30:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:04,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:04,130 INFO L87 Difference]: Start difference. First operand 333 states and 484 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:04,338 INFO L93 Difference]: Finished difference Result 753 states and 1065 transitions. [2023-12-19 01:30:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-19 01:30:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:04,343 INFO L225 Difference]: With dead ends: 753 [2023-12-19 01:30:04,343 INFO L226 Difference]: Without dead ends: 542 [2023-12-19 01:30:04,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:04,348 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:04,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 477 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-19 01:30:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 438. [2023-12-19 01:30:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 374 states have (on average 1.4304812834224598) internal successors, (535), 381 states have internal predecessors, (535), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2023-12-19 01:30:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 625 transitions. [2023-12-19 01:30:04,382 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 625 transitions. Word has length 39 [2023-12-19 01:30:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:04,382 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 625 transitions. [2023-12-19 01:30:04,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 625 transitions. [2023-12-19 01:30:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-19 01:30:04,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:04,384 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-19 01:30:04,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:30:04,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:04,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1197660736, now seen corresponding path program 1 times [2023-12-19 01:30:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763812849] [2023-12-19 01:30:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 01:30:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:30:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:04,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763812849] [2023-12-19 01:30:04,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763812849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:04,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:04,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722219688] [2023-12-19 01:30:04,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:04,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:04,491 INFO L87 Difference]: Start difference. First operand 438 states and 625 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:04,684 INFO L93 Difference]: Finished difference Result 954 states and 1342 transitions. [2023-12-19 01:30:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-19 01:30:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:04,687 INFO L225 Difference]: With dead ends: 954 [2023-12-19 01:30:04,687 INFO L226 Difference]: Without dead ends: 638 [2023-12-19 01:30:04,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:04,689 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 141 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:04,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 521 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-12-19 01:30:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 604. [2023-12-19 01:30:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.377906976744186) internal successors, (711), 525 states have internal predecessors, (711), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2023-12-19 01:30:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 839 transitions. [2023-12-19 01:30:04,717 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 839 transitions. Word has length 54 [2023-12-19 01:30:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:04,718 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 839 transitions. [2023-12-19 01:30:04,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 839 transitions. [2023-12-19 01:30:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:30:04,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:04,721 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-19 01:30:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:30:04,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:04,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash 119218933, now seen corresponding path program 1 times [2023-12-19 01:30:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986645380] [2023-12-19 01:30:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:30:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:30:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986645380] [2023-12-19 01:30:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986645380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:04,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:04,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998443226] [2023-12-19 01:30:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:04,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:04,813 INFO L87 Difference]: Start difference. First operand 604 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:04,988 INFO L93 Difference]: Finished difference Result 1183 states and 1618 transitions. [2023-12-19 01:30:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-12-19 01:30:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:04,993 INFO L225 Difference]: With dead ends: 1183 [2023-12-19 01:30:04,993 INFO L226 Difference]: Without dead ends: 781 [2023-12-19 01:30:04,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:05,000 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 315 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:05,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 369 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-19 01:30:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 732. [2023-12-19 01:30:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 628 states have (on average 1.3471337579617835) internal successors, (846), 639 states have internal predecessors, (846), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2023-12-19 01:30:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 996 transitions. [2023-12-19 01:30:05,045 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 996 transitions. Word has length 59 [2023-12-19 01:30:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:05,045 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 996 transitions. [2023-12-19 01:30:05,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 996 transitions. [2023-12-19 01:30:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:30:05,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:05,048 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-19 01:30:05,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:30:05,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:05,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 157658772, now seen corresponding path program 1 times [2023-12-19 01:30:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731102559] [2023-12-19 01:30:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 01:30:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:05,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731102559] [2023-12-19 01:30:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731102559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:05,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:05,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:30:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130280714] [2023-12-19 01:30:05,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:05,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:05,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:05,166 INFO L87 Difference]: Start difference. First operand 732 states and 996 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:05,361 INFO L93 Difference]: Finished difference Result 1218 states and 1658 transitions. [2023-12-19 01:30:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:30:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-19 01:30:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:05,365 INFO L225 Difference]: With dead ends: 1218 [2023-12-19 01:30:05,365 INFO L226 Difference]: Without dead ends: 680 [2023-12-19 01:30:05,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:05,369 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 93 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:05,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 607 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-12-19 01:30:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 607. [2023-12-19 01:30:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 520 states have (on average 1.3442307692307693) internal successors, (699), 530 states have internal predecessors, (699), 52 states have call successors, (52), 29 states have call predecessors, (52), 33 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-19 01:30:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 821 transitions. [2023-12-19 01:30:05,402 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 821 transitions. Word has length 60 [2023-12-19 01:30:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:05,403 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 821 transitions. [2023-12-19 01:30:05,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 821 transitions. [2023-12-19 01:30:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:30:05,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:05,405 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-19 01:30:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:30:05,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:05,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1955298388, now seen corresponding path program 1 times [2023-12-19 01:30:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57476333] [2023-12-19 01:30:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 01:30:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57476333] [2023-12-19 01:30:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57476333] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881537268] [2023-12-19 01:30:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:05,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:05,489 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-19 01:30:05,511 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-19 01:30:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:30:05,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:05,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:30:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 01:30:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881537268] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-19 01:30:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-19 01:30:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728539124] [2023-12-19 01:30:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:05,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:05,704 INFO L87 Difference]: Start difference. First operand 607 states and 821 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:05,825 INFO L93 Difference]: Finished difference Result 656 states and 882 transitions. [2023-12-19 01:30:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:30:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-19 01:30:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:05,829 INFO L225 Difference]: With dead ends: 656 [2023-12-19 01:30:05,829 INFO L226 Difference]: Without dead ends: 653 [2023-12-19 01:30:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:30:05,830 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 440 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:05,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 311 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-12-19 01:30:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 606. [2023-12-19 01:30:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 520 states have (on average 1.3403846153846153) internal successors, (697), 529 states have internal predecessors, (697), 51 states have call successors, (51), 29 states have call predecessors, (51), 33 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-19 01:30:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 818 transitions. [2023-12-19 01:30:05,865 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 818 transitions. Word has length 60 [2023-12-19 01:30:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:05,865 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 818 transitions. [2023-12-19 01:30:05,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 818 transitions. [2023-12-19 01:30:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:05,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:05,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:05,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:06,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:06,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:06,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1127040550, now seen corresponding path program 1 times [2023-12-19 01:30:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398583588] [2023-12-19 01:30:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,212 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-19 01:30:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398583588] [2023-12-19 01:30:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398583588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:30:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652571178] [2023-12-19 01:30:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:06,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:30:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:06,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:30:06,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:06,214 INFO L87 Difference]: Start difference. First operand 606 states and 818 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:06,809 INFO L93 Difference]: Finished difference Result 881 states and 1244 transitions. [2023-12-19 01:30:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:30:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:06,813 INFO L225 Difference]: With dead ends: 881 [2023-12-19 01:30:06,813 INFO L226 Difference]: Without dead ends: 773 [2023-12-19 01:30:06,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:30:06,814 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 518 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:06,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 531 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:30:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-19 01:30:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 714. [2023-12-19 01:30:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 610 states have (on average 1.3688524590163935) internal successors, (835), 620 states have internal predecessors, (835), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (84), 59 states have call predecessors, (84), 61 states have call successors, (84) [2023-12-19 01:30:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 981 transitions. [2023-12-19 01:30:06,850 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 981 transitions. Word has length 61 [2023-12-19 01:30:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:06,850 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 981 transitions. [2023-12-19 01:30:06,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 981 transitions. [2023-12-19 01:30:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:06,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:06,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:06,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:30:06,851 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:06,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1159478042, now seen corresponding path program 1 times [2023-12-19 01:30:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241234755] [2023-12-19 01:30:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,926 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-19 01:30:06,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241234755] [2023-12-19 01:30:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241234755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:06,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:06,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305508985] [2023-12-19 01:30:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:06,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:06,927 INFO L87 Difference]: Start difference. First operand 714 states and 981 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:07,599 INFO L93 Difference]: Finished difference Result 1126 states and 1610 transitions. [2023-12-19 01:30:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:30:07,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:07,603 INFO L225 Difference]: With dead ends: 1126 [2023-12-19 01:30:07,603 INFO L226 Difference]: Without dead ends: 910 [2023-12-19 01:30:07,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:30:07,605 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 523 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:07,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 870 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:30:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2023-12-19 01:30:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 815. [2023-12-19 01:30:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 693 states have (on average 1.3838383838383839) internal successors, (959), 704 states have internal predecessors, (959), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (97), 71 states have call predecessors, (97), 72 states have call successors, (97) [2023-12-19 01:30:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1129 transitions. [2023-12-19 01:30:07,648 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1129 transitions. Word has length 61 [2023-12-19 01:30:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:07,648 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1129 transitions. [2023-12-19 01:30:07,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1129 transitions. [2023-12-19 01:30:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:07,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:07,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:07,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:30:07,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:07,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1174996760, now seen corresponding path program 1 times [2023-12-19 01:30:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:07,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074926804] [2023-12-19 01:30:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,728 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-19 01:30:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074926804] [2023-12-19 01:30:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074926804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321067473] [2023-12-19 01:30:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:07,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:07,729 INFO L87 Difference]: Start difference. First operand 815 states and 1129 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:08,572 INFO L93 Difference]: Finished difference Result 1547 states and 2242 transitions. [2023-12-19 01:30:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:30:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:08,578 INFO L225 Difference]: With dead ends: 1547 [2023-12-19 01:30:08,578 INFO L226 Difference]: Without dead ends: 1230 [2023-12-19 01:30:08,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:30:08,580 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 537 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:08,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 861 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:30:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-12-19 01:30:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1017. [2023-12-19 01:30:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 861 states have (on average 1.4076655052264808) internal successors, (1212), 874 states have internal predecessors, (1212), 93 states have call successors, (93), 53 states have call predecessors, (93), 61 states have return successors, (125), 93 states have call predecessors, (125), 92 states have call successors, (125) [2023-12-19 01:30:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1430 transitions. [2023-12-19 01:30:08,627 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1430 transitions. Word has length 61 [2023-12-19 01:30:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:08,627 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1430 transitions. [2023-12-19 01:30:08,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1430 transitions. [2023-12-19 01:30:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:08,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:08,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:30:08,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1528085142, now seen corresponding path program 1 times [2023-12-19 01:30:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565260553] [2023-12-19 01:30:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,708 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-19 01:30:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565260553] [2023-12-19 01:30:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565260553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955356688] [2023-12-19 01:30:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:08,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:08,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:08,710 INFO L87 Difference]: Start difference. First operand 1017 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:09,444 INFO L93 Difference]: Finished difference Result 2251 states and 3293 transitions. [2023-12-19 01:30:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:30:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:09,451 INFO L225 Difference]: With dead ends: 2251 [2023-12-19 01:30:09,451 INFO L226 Difference]: Without dead ends: 1732 [2023-12-19 01:30:09,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:30:09,453 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 564 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:09,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 857 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:30:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-12-19 01:30:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1398. [2023-12-19 01:30:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1176 states have (on average 1.4319727891156462) internal successors, (1684), 1193 states have internal predecessors, (1684), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-19 01:30:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2000 transitions. [2023-12-19 01:30:09,538 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2000 transitions. Word has length 61 [2023-12-19 01:30:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:09,538 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 2000 transitions. [2023-12-19 01:30:09,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2000 transitions. [2023-12-19 01:30:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:09,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:09,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:30:09,540 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:09,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 400187560, now seen corresponding path program 1 times [2023-12-19 01:30:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518679773] [2023-12-19 01:30:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,619 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-19 01:30:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518679773] [2023-12-19 01:30:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518679773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:09,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:09,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402715213] [2023-12-19 01:30:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:09,621 INFO L87 Difference]: Start difference. First operand 1398 states and 2000 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:10,014 INFO L93 Difference]: Finished difference Result 2511 states and 3698 transitions. [2023-12-19 01:30:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:30:10,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:10,022 INFO L225 Difference]: With dead ends: 2511 [2023-12-19 01:30:10,022 INFO L226 Difference]: Without dead ends: 1611 [2023-12-19 01:30:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:30:10,026 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 497 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:10,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 444 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2023-12-19 01:30:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1398. [2023-12-19 01:30:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1176 states have (on average 1.4243197278911566) internal successors, (1675), 1193 states have internal predecessors, (1675), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-19 01:30:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1991 transitions. [2023-12-19 01:30:10,146 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1991 transitions. Word has length 61 [2023-12-19 01:30:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:10,146 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 1991 transitions. [2023-12-19 01:30:10,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1991 transitions. [2023-12-19 01:30:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:10,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:10,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:30:10,148 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:10,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1293673898, now seen corresponding path program 1 times [2023-12-19 01:30:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153632778] [2023-12-19 01:30:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,233 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-19 01:30:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153632778] [2023-12-19 01:30:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153632778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:30:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592627763] [2023-12-19 01:30:10,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:10,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:30:10,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:30:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:10,235 INFO L87 Difference]: Start difference. First operand 1398 states and 1991 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:10,647 INFO L93 Difference]: Finished difference Result 2580 states and 3787 transitions. [2023-12-19 01:30:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 01:30:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:10,654 INFO L225 Difference]: With dead ends: 2580 [2023-12-19 01:30:10,654 INFO L226 Difference]: Without dead ends: 1681 [2023-12-19 01:30:10,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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-19 01:30:10,657 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 217 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:10,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 616 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-12-19 01:30:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1416. [2023-12-19 01:30:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1194 states have (on average 1.417922948073702) internal successors, (1693), 1211 states have internal predecessors, (1693), 131 states have call successors, (131), 77 states have call predecessors, (131), 89 states have return successors, (185), 135 states have call predecessors, (185), 130 states have call successors, (185) [2023-12-19 01:30:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2009 transitions. [2023-12-19 01:30:10,768 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2009 transitions. Word has length 61 [2023-12-19 01:30:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:10,769 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 2009 transitions. [2023-12-19 01:30:10,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2009 transitions. [2023-12-19 01:30:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:10,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:10,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:10,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:30:10,771 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:10,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1953205420, now seen corresponding path program 1 times [2023-12-19 01:30:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404011110] [2023-12-19 01:30:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,867 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-19 01:30:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404011110] [2023-12-19 01:30:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404011110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498379469] [2023-12-19 01:30:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:10,869 INFO L87 Difference]: Start difference. First operand 1416 states and 2009 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:11,965 INFO L93 Difference]: Finished difference Result 4621 states and 6923 transitions. [2023-12-19 01:30:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:30:11,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-19 01:30:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:11,982 INFO L225 Difference]: With dead ends: 4621 [2023-12-19 01:30:11,983 INFO L226 Difference]: Without dead ends: 3704 [2023-12-19 01:30:11,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:30:11,989 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1204 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:11,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 710 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:30:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2023-12-19 01:30:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3182. [2023-12-19 01:30:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2648 states have (on average 1.4373111782477341) internal successors, (3806), 2696 states have internal predecessors, (3806), 315 states have call successors, (315), 189 states have call predecessors, (315), 217 states have return successors, (484), 304 states have call predecessors, (484), 314 states have call successors, (484) [2023-12-19 01:30:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4605 transitions. [2023-12-19 01:30:12,222 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4605 transitions. Word has length 61 [2023-12-19 01:30:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:12,223 INFO L495 AbstractCegarLoop]: Abstraction has 3182 states and 4605 transitions. [2023-12-19 01:30:12,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:30:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4605 transitions. [2023-12-19 01:30:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:12,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:12,226 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-19 01:30:12,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 01:30:12,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:12,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 484045592, now seen corresponding path program 1 times [2023-12-19 01:30:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022588266] [2023-12-19 01:30:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 01:30:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022588266] [2023-12-19 01:30:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022588266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526994812] [2023-12-19 01:30:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:12,278 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-19 01:30:12,296 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-19 01:30:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 01:30:12,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:12,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:30:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 01:30:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526994812] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:30:12,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:30:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2023-12-19 01:30:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151074645] [2023-12-19 01:30:12,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:30:12,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:30:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:30:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:30:12,523 INFO L87 Difference]: Start difference. First operand 3182 states and 4605 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-19 01:30:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:13,247 INFO L93 Difference]: Finished difference Result 4418 states and 6257 transitions. [2023-12-19 01:30:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 01:30:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2023-12-19 01:30:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:13,265 INFO L225 Difference]: With dead ends: 4418 [2023-12-19 01:30:13,265 INFO L226 Difference]: Without dead ends: 4020 [2023-12-19 01:30:13,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-19 01:30:13,271 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 539 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:13,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1416 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2023-12-19 01:30:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3511. [2023-12-19 01:30:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2940 states have (on average 1.4217687074829932) internal successors, (4180), 2995 states have internal predecessors, (4180), 334 states have call successors, (334), 202 states have call predecessors, (334), 235 states have return successors, (515), 321 states have call predecessors, (515), 333 states have call successors, (515) [2023-12-19 01:30:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5029 transitions. [2023-12-19 01:30:13,495 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5029 transitions. Word has length 61 [2023-12-19 01:30:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:13,495 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 5029 transitions. [2023-12-19 01:30:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-19 01:30:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5029 transitions. [2023-12-19 01:30:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-19 01:30:13,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:13,500 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:13,511 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-19 01:30:13,707 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,SelfDestructingSolverStorable14 [2023-12-19 01:30:13,707 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:13,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1275804189, now seen corresponding path program 1 times [2023-12-19 01:30:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492818667] [2023-12-19 01:30:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:13,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-19 01:30:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-19 01:30:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492818667] [2023-12-19 01:30:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492818667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199738637] [2023-12-19 01:30:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:13,761 INFO L87 Difference]: Start difference. First operand 3511 states and 5029 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 01:30:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:14,057 INFO L93 Difference]: Finished difference Result 4145 states and 5852 transitions. [2023-12-19 01:30:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-19 01:30:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:14,071 INFO L225 Difference]: With dead ends: 4145 [2023-12-19 01:30:14,071 INFO L226 Difference]: Without dead ends: 3480 [2023-12-19 01:30:14,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:14,075 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 326 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:14,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 385 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2023-12-19 01:30:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3403. [2023-12-19 01:30:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 2845 states have (on average 1.4242530755711775) internal successors, (4052), 2900 states have internal predecessors, (4052), 327 states have call successors, (327), 197 states have call predecessors, (327), 229 states have return successors, (504), 313 states have call predecessors, (504), 326 states have call successors, (504) [2023-12-19 01:30:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4883 transitions. [2023-12-19 01:30:14,326 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4883 transitions. Word has length 78 [2023-12-19 01:30:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:14,326 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 4883 transitions. [2023-12-19 01:30:14,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 01:30:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4883 transitions. [2023-12-19 01:30:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-19 01:30:14,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:14,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:14,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 01:30:14,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:14,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1576457092, now seen corresponding path program 1 times [2023-12-19 01:30:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050132953] [2023-12-19 01:30:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-19 01:30:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 01:30:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 01:30:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:30:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050132953] [2023-12-19 01:30:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050132953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894594298] [2023-12-19 01:30:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:14,393 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-19 01:30:14,412 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-19 01:30:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:14,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:30:14,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894594298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-19 01:30:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980473016] [2023-12-19 01:30:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:14,488 INFO L87 Difference]: Start difference. First operand 3403 states and 4883 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-19 01:30:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:14,644 INFO L93 Difference]: Finished difference Result 3688 states and 5241 transitions. [2023-12-19 01:30:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:14,645 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2023-12-19 01:30:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:14,661 INFO L225 Difference]: With dead ends: 3688 [2023-12-19 01:30:14,662 INFO L226 Difference]: Without dead ends: 2693 [2023-12-19 01:30:14,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:14,664 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 55 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:14,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 486 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2023-12-19 01:30:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2693. [2023-12-19 01:30:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2222 states have (on average 1.4635463546354635) internal successors, (3252), 2262 states have internal predecessors, (3252), 280 states have call successors, (280), 166 states have call predecessors, (280), 190 states have return successors, (430), 272 states have call predecessors, (430), 280 states have call successors, (430) [2023-12-19 01:30:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3962 transitions. [2023-12-19 01:30:14,795 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3962 transitions. Word has length 92 [2023-12-19 01:30:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:14,795 INFO L495 AbstractCegarLoop]: Abstraction has 2693 states and 3962 transitions. [2023-12-19 01:30:14,795 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-19 01:30:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3962 transitions. [2023-12-19 01:30:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 01:30:14,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:14,800 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] [2023-12-19 01:30:14,810 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-19 01:30:15,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:15,006 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:15,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:15,007 INFO L85 PathProgramCache]: Analyzing trace with hash -880498830, now seen corresponding path program 1 times [2023-12-19 01:30:15,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:15,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283062860] [2023-12-19 01:30:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:30:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-19 01:30:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283062860] [2023-12-19 01:30:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283062860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530259293] [2023-12-19 01:30:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:15,088 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-19 01:30:15,112 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-19 01:30:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:15,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 01:30:15,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530259293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:30:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865627487] [2023-12-19 01:30:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:15,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:15,216 INFO L87 Difference]: Start difference. First operand 2693 states and 3962 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:30:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:15,477 INFO L93 Difference]: Finished difference Result 7964 states and 11847 transitions. [2023-12-19 01:30:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2023-12-19 01:30:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:15,497 INFO L225 Difference]: With dead ends: 7964 [2023-12-19 01:30:15,497 INFO L226 Difference]: Without dead ends: 5281 [2023-12-19 01:30:15,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:15,507 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 134 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:15,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 295 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2023-12-19 01:30:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 5251. [2023-12-19 01:30:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 4334 states have (on average 1.45523765574527) internal successors, (6307), 4413 states have internal predecessors, (6307), 538 states have call successors, (538), 330 states have call predecessors, (538), 378 states have return successors, (822), 515 states have call predecessors, (822), 538 states have call successors, (822) [2023-12-19 01:30:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 7667 transitions. [2023-12-19 01:30:15,831 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 7667 transitions. Word has length 99 [2023-12-19 01:30:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:15,831 INFO L495 AbstractCegarLoop]: Abstraction has 5251 states and 7667 transitions. [2023-12-19 01:30:15,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:30:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 7667 transitions. [2023-12-19 01:30:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 01:30:15,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:15,838 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] [2023-12-19 01:30:15,847 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-19 01:30:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-19 01:30:16,045 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:16,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash -715203438, now seen corresponding path program 1 times [2023-12-19 01:30:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105127513] [2023-12-19 01:30:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:30:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-19 01:30:16,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:16,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105127513] [2023-12-19 01:30:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105127513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:30:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913969029] [2023-12-19 01:30:16,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:30:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:30:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:16,148 INFO L87 Difference]: Start difference. First operand 5251 states and 7667 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:30:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:16,779 INFO L93 Difference]: Finished difference Result 11584 states and 17359 transitions. [2023-12-19 01:30:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:30:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2023-12-19 01:30:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:16,804 INFO L225 Difference]: With dead ends: 11584 [2023-12-19 01:30:16,804 INFO L226 Difference]: Without dead ends: 6343 [2023-12-19 01:30:16,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:30:16,818 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:16,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 382 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2023-12-19 01:30:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 5307. [2023-12-19 01:30:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 4390 states have (on average 1.4430523917995444) internal successors, (6335), 4469 states have internal predecessors, (6335), 538 states have call successors, (538), 330 states have call predecessors, (538), 378 states have return successors, (822), 515 states have call predecessors, (822), 538 states have call successors, (822) [2023-12-19 01:30:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 7695 transitions. [2023-12-19 01:30:17,156 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 7695 transitions. Word has length 99 [2023-12-19 01:30:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:17,156 INFO L495 AbstractCegarLoop]: Abstraction has 5307 states and 7695 transitions. [2023-12-19 01:30:17,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:30:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 7695 transitions. [2023-12-19 01:30:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 01:30:17,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:17,162 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] [2023-12-19 01:30:17,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 01:30:17,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:17,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1759570514, now seen corresponding path program 1 times [2023-12-19 01:30:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:17,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101699572] [2023-12-19 01:30:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:17,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:30:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-19 01:30:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101699572] [2023-12-19 01:30:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101699572] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022031822] [2023-12-19 01:30:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:17,248 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-19 01:30:17,252 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-19 01:30:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:17,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:30:17,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022031822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893622855] [2023-12-19 01:30:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:17,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:17,346 INFO L87 Difference]: Start difference. First operand 5307 states and 7695 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:30:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:17,757 INFO L93 Difference]: Finished difference Result 15583 states and 22735 transitions. [2023-12-19 01:30:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2023-12-19 01:30:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:17,783 INFO L225 Difference]: With dead ends: 15583 [2023-12-19 01:30:17,783 INFO L226 Difference]: Without dead ends: 6268 [2023-12-19 01:30:17,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:17,803 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 144 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:17,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 449 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2023-12-19 01:30:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6268. [2023-12-19 01:30:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 5188 states have (on average 1.4406322282189667) internal successors, (7474), 5275 states have internal predecessors, (7474), 633 states have call successors, (633), 390 states have call predecessors, (633), 446 states have return successors, (972), 610 states have call predecessors, (972), 633 states have call successors, (972) [2023-12-19 01:30:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 9079 transitions. [2023-12-19 01:30:18,236 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 9079 transitions. Word has length 99 [2023-12-19 01:30:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:18,236 INFO L495 AbstractCegarLoop]: Abstraction has 6268 states and 9079 transitions. [2023-12-19 01:30:18,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:30:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 9079 transitions. [2023-12-19 01:30:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 01:30:18,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:18,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 01:30:18,258 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-19 01:30:18,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:18,455 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:18,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1670722888, now seen corresponding path program 1 times [2023-12-19 01:30:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501496859] [2023-12-19 01:30:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:30:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:30:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-19 01:30:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501496859] [2023-12-19 01:30:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501496859] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776699649] [2023-12-19 01:30:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:18,560 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-19 01:30:18,580 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-19 01:30:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:18,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:30:18,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776699649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:30:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454074740] [2023-12-19 01:30:18,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:18,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:18,712 INFO L87 Difference]: Start difference. First operand 6268 states and 9079 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-19 01:30:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:19,077 INFO L93 Difference]: Finished difference Result 13026 states and 19068 transitions. [2023-12-19 01:30:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 127 [2023-12-19 01:30:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:19,101 INFO L225 Difference]: With dead ends: 13026 [2023-12-19 01:30:19,102 INFO L226 Difference]: Without dead ends: 9120 [2023-12-19 01:30:19,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:19,115 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 94 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:19,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2023-12-19 01:30:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 9060. [2023-12-19 01:30:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 7515 states have (on average 1.439387890884897) internal successors, (10817), 7636 states have internal predecessors, (10817), 901 states have call successors, (901), 563 states have call predecessors, (901), 643 states have return successors, (1353), 868 states have call predecessors, (1353), 901 states have call successors, (1353) [2023-12-19 01:30:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 13071 transitions. [2023-12-19 01:30:19,558 INFO L78 Accepts]: Start accepts. Automaton has 9060 states and 13071 transitions. Word has length 127 [2023-12-19 01:30:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:19,559 INFO L495 AbstractCegarLoop]: Abstraction has 9060 states and 13071 transitions. [2023-12-19 01:30:19,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-19 01:30:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 9060 states and 13071 transitions. [2023-12-19 01:30:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 01:30:19,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:19,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:19,590 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-19 01:30:19,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:19,779 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:19,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1558039379, now seen corresponding path program 1 times [2023-12-19 01:30:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364309855] [2023-12-19 01:30:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:30:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:30:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:30:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:30:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-19 01:30:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364309855] [2023-12-19 01:30:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364309855] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208309725] [2023-12-19 01:30:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:19,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:19,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:19,888 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-19 01:30:19,904 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-19 01:30:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:19,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 01:30:20,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208309725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641674159] [2023-12-19 01:30:20,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:20,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:20,029 INFO L87 Difference]: Start difference. First operand 9060 states and 13071 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-19 01:30:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:20,443 INFO L93 Difference]: Finished difference Result 19074 states and 27782 transitions. [2023-12-19 01:30:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 143 [2023-12-19 01:30:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:20,466 INFO L225 Difference]: With dead ends: 19074 [2023-12-19 01:30:20,466 INFO L226 Difference]: Without dead ends: 10025 [2023-12-19 01:30:20,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:20,485 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:20,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 185 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10025 states. [2023-12-19 01:30:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10025 to 10025. [2023-12-19 01:30:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10025 states, 8372 states have (on average 1.388676540850454) internal successors, (11626), 8503 states have internal predecessors, (11626), 926 states have call successors, (926), 626 states have call predecessors, (926), 726 states have return successors, (1401), 903 states have call predecessors, (1401), 926 states have call successors, (1401) [2023-12-19 01:30:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10025 states to 10025 states and 13953 transitions. [2023-12-19 01:30:21,110 INFO L78 Accepts]: Start accepts. Automaton has 10025 states and 13953 transitions. Word has length 143 [2023-12-19 01:30:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 10025 states and 13953 transitions. [2023-12-19 01:30:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-19 01:30:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10025 states and 13953 transitions. [2023-12-19 01:30:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 01:30:21,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:21,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 01:30:21,134 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-19 01:30:21,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:21,334 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:21,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -396985077, now seen corresponding path program 1 times [2023-12-19 01:30:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:21,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94767865] [2023-12-19 01:30:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:30:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:30:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:30:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:30:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-19 01:30:21,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94767865] [2023-12-19 01:30:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94767865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67911576] [2023-12-19 01:30:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:21,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:21,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:21,430 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-19 01:30:21,460 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-19 01:30:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:21,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-19 01:30:21,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:21,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67911576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:21,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380366332] [2023-12-19 01:30:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:21,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:21,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:21,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:21,568 INFO L87 Difference]: Start difference. First operand 10025 states and 13953 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:22,298 INFO L93 Difference]: Finished difference Result 21119 states and 29216 transitions. [2023-12-19 01:30:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:22,298 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 143 [2023-12-19 01:30:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:22,324 INFO L225 Difference]: With dead ends: 21119 [2023-12-19 01:30:22,324 INFO L226 Difference]: Without dead ends: 11105 [2023-12-19 01:30:22,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:22,337 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 150 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:22,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 304 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2023-12-19 01:30:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 10812. [2023-12-19 01:30:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10812 states, 9103 states have (on average 1.3421948808085247) internal successors, (12218), 9224 states have internal predecessors, (12218), 924 states have call successors, (924), 684 states have call predecessors, (924), 784 states have return successors, (1397), 911 states have call predecessors, (1397), 924 states have call successors, (1397) [2023-12-19 01:30:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 14539 transitions. [2023-12-19 01:30:22,789 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 14539 transitions. Word has length 143 [2023-12-19 01:30:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 10812 states and 14539 transitions. [2023-12-19 01:30:22,790 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 14539 transitions. [2023-12-19 01:30:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:30:22,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:22,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:22,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:23,009 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,SelfDestructingSolverStorable22 [2023-12-19 01:30:23,009 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:23,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1880101965, now seen corresponding path program 1 times [2023-12-19 01:30:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687129365] [2023-12-19 01:30:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:30:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:30:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:30:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-19 01:30:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687129365] [2023-12-19 01:30:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687129365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314092773] [2023-12-19 01:30:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:23,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:23,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:23,124 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-19 01:30:23,152 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-19 01:30:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:23,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:23,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:30:23,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314092773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225878124] [2023-12-19 01:30:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:23,255 INFO L87 Difference]: Start difference. First operand 10812 states and 14539 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:30:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:23,939 INFO L93 Difference]: Finished difference Result 29394 states and 39520 transitions. [2023-12-19 01:30:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-12-19 01:30:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:23,988 INFO L225 Difference]: With dead ends: 29394 [2023-12-19 01:30:23,988 INFO L226 Difference]: Without dead ends: 18593 [2023-12-19 01:30:24,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:24,009 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 135 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:24,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 439 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18593 states. [2023-12-19 01:30:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18593 to 18579. [2023-12-19 01:30:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18579 states, 15661 states have (on average 1.329544728944512) internal successors, (20822), 15873 states have internal predecessors, (20822), 1561 states have call successors, (1561), 1176 states have call predecessors, (1561), 1356 states have return successors, (2433), 1545 states have call predecessors, (2433), 1561 states have call successors, (2433) [2023-12-19 01:30:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18579 states to 18579 states and 24816 transitions. [2023-12-19 01:30:24,848 INFO L78 Accepts]: Start accepts. Automaton has 18579 states and 24816 transitions. Word has length 144 [2023-12-19 01:30:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:24,849 INFO L495 AbstractCegarLoop]: Abstraction has 18579 states and 24816 transitions. [2023-12-19 01:30:24,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:30:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18579 states and 24816 transitions. [2023-12-19 01:30:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:30:24,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:24,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 01:30:24,875 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-19 01:30:25,074 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,SelfDestructingSolverStorable23 [2023-12-19 01:30:25,075 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:25,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1887934140, now seen corresponding path program 1 times [2023-12-19 01:30:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280124115] [2023-12-19 01:30:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:30:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:30:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:30:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-19 01:30:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280124115] [2023-12-19 01:30:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280124115] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540784132] [2023-12-19 01:30:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:25,167 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-19 01:30:25,188 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-19 01:30:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:25,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:25,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 01:30:25,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540784132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830542985] [2023-12-19 01:30:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:25,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:25,331 INFO L87 Difference]: Start difference. First operand 18579 states and 24816 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:30:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:25,996 INFO L93 Difference]: Finished difference Result 26995 states and 36328 transitions. [2023-12-19 01:30:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2023-12-19 01:30:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:26,021 INFO L225 Difference]: With dead ends: 26995 [2023-12-19 01:30:26,021 INFO L226 Difference]: Without dead ends: 8278 [2023-12-19 01:30:26,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:26,052 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:26,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 176 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2023-12-19 01:30:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7702. [2023-12-19 01:30:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7702 states, 6507 states have (on average 1.2906101121868756) internal successors, (8398), 6568 states have internal predecessors, (8398), 644 states have call successors, (644), 494 states have call predecessors, (644), 550 states have return successors, (861), 643 states have call predecessors, (861), 644 states have call successors, (861) [2023-12-19 01:30:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7702 states to 7702 states and 9903 transitions. [2023-12-19 01:30:26,541 INFO L78 Accepts]: Start accepts. Automaton has 7702 states and 9903 transitions. Word has length 144 [2023-12-19 01:30:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:26,541 INFO L495 AbstractCegarLoop]: Abstraction has 7702 states and 9903 transitions. [2023-12-19 01:30:26,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:30:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7702 states and 9903 transitions. [2023-12-19 01:30:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-19 01:30:26,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:26,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2023-12-19 01:30:26,559 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-19 01:30:26,758 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,SelfDestructingSolverStorable24 [2023-12-19 01:30:26,759 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:26,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -642866549, now seen corresponding path program 1 times [2023-12-19 01:30:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735343104] [2023-12-19 01:30:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 01:30:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:30:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-19 01:30:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-19 01:30:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-12-19 01:30:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735343104] [2023-12-19 01:30:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735343104] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438883933] [2023-12-19 01:30:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:26,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:26,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:26,889 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-19 01:30:26,894 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-19 01:30:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:27,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:27,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:30:27,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438883933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519189405] [2023-12-19 01:30:27,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:27,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:27,048 INFO L87 Difference]: Start difference. First operand 7702 states and 9903 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-19 01:30:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:27,480 INFO L93 Difference]: Finished difference Result 14138 states and 18514 transitions. [2023-12-19 01:30:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:27,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 178 [2023-12-19 01:30:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:27,497 INFO L225 Difference]: With dead ends: 14138 [2023-12-19 01:30:27,497 INFO L226 Difference]: Without dead ends: 6757 [2023-12-19 01:30:27,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:27,506 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 122 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:27,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 177 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2023-12-19 01:30:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6164. [2023-12-19 01:30:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 5215 states have (on average 1.2473633748801534) internal successors, (6505), 5260 states have internal predecessors, (6505), 512 states have call successors, (512), 396 states have call predecessors, (512), 436 states have return successors, (651), 509 states have call predecessors, (651), 512 states have call successors, (651) [2023-12-19 01:30:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 7668 transitions. [2023-12-19 01:30:27,768 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 7668 transitions. Word has length 178 [2023-12-19 01:30:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:27,768 INFO L495 AbstractCegarLoop]: Abstraction has 6164 states and 7668 transitions. [2023-12-19 01:30:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-19 01:30:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 7668 transitions. [2023-12-19 01:30:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-19 01:30:27,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:27,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:27,782 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-19 01:30:27,979 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,SelfDestructingSolverStorable25 [2023-12-19 01:30:27,980 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:27,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 392034281, now seen corresponding path program 1 times [2023-12-19 01:30:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225981435] [2023-12-19 01:30:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 01:30:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:30:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-19 01:30:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-19 01:30:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-19 01:30:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225981435] [2023-12-19 01:30:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225981435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243740881] [2023-12-19 01:30:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:28,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:28,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:28,064 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-19 01:30:28,068 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-19 01:30:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:28,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-19 01:30:28,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243740881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:28,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793123182] [2023-12-19 01:30:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:28,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:28,201 INFO L87 Difference]: Start difference. First operand 6164 states and 7668 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:30:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:28,682 INFO L93 Difference]: Finished difference Result 17247 states and 21613 transitions. [2023-12-19 01:30:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 178 [2023-12-19 01:30:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:28,706 INFO L225 Difference]: With dead ends: 17247 [2023-12-19 01:30:28,706 INFO L226 Difference]: Without dead ends: 11094 [2023-12-19 01:30:28,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:28,718 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 129 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:28,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 419 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11094 states. [2023-12-19 01:30:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11094 to 11092. [2023-12-19 01:30:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11092 states, 9344 states have (on average 1.2350171232876712) internal successors, (11540), 9428 states have internal predecessors, (11540), 955 states have call successors, (955), 724 states have call predecessors, (955), 792 states have return successors, (1344), 943 states have call predecessors, (1344), 955 states have call successors, (1344) [2023-12-19 01:30:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 13839 transitions. [2023-12-19 01:30:29,285 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 13839 transitions. Word has length 178 [2023-12-19 01:30:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:29,285 INFO L495 AbstractCegarLoop]: Abstraction has 11092 states and 13839 transitions. [2023-12-19 01:30:29,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:30:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 13839 transitions. [2023-12-19 01:30:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-19 01:30:29,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:29,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:29,300 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-19 01:30:29,498 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,SelfDestructingSolverStorable26 [2023-12-19 01:30:29,498 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:29,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1461843753, now seen corresponding path program 1 times [2023-12-19 01:30:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542541990] [2023-12-19 01:30:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:30:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 01:30:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-19 01:30:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-19 01:30:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:29,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542541990] [2023-12-19 01:30:29,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542541990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:29,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266462137] [2023-12-19 01:30:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:29,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:29,591 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-19 01:30:29,617 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-19 01:30:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:29,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:29,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-19 01:30:29,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266462137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11411969] [2023-12-19 01:30:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:29,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:29,734 INFO L87 Difference]: Start difference. First operand 11092 states and 13839 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:30:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:30,189 INFO L93 Difference]: Finished difference Result 18986 states and 24239 transitions. [2023-12-19 01:30:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 179 [2023-12-19 01:30:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:30,216 INFO L225 Difference]: With dead ends: 18986 [2023-12-19 01:30:30,216 INFO L226 Difference]: Without dead ends: 11102 [2023-12-19 01:30:30,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:30,230 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 117 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:30,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 399 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11102 states. [2023-12-19 01:30:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11102 to 11084. [2023-12-19 01:30:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11084 states, 9336 states have (on average 1.2122964867180805) internal successors, (11318), 9420 states have internal predecessors, (11318), 955 states have call successors, (955), 724 states have call predecessors, (955), 792 states have return successors, (1344), 943 states have call predecessors, (1344), 955 states have call successors, (1344) [2023-12-19 01:30:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 13617 transitions. [2023-12-19 01:30:30,728 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 13617 transitions. Word has length 179 [2023-12-19 01:30:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:30,728 INFO L495 AbstractCegarLoop]: Abstraction has 11084 states and 13617 transitions. [2023-12-19 01:30:30,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 01:30:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 13617 transitions. [2023-12-19 01:30:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-19 01:30:30,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:30,736 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:30,741 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-19 01:30:30,941 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,SelfDestructingSolverStorable27 [2023-12-19 01:30:30,941 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:30,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1197244821, now seen corresponding path program 1 times [2023-12-19 01:30:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228296518] [2023-12-19 01:30:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:30,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:30:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-19 01:30:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-19 01:30:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-19 01:30:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228296518] [2023-12-19 01:30:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228296518] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287531637] [2023-12-19 01:30:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:31,084 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-19 01:30:31,116 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-19 01:30:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:31,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:31,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:30:31,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287531637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:31,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458928814] [2023-12-19 01:30:31,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:31,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:31,257 INFO L87 Difference]: Start difference. First operand 11084 states and 13617 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-19 01:30:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:31,731 INFO L93 Difference]: Finished difference Result 19159 states and 24107 transitions. [2023-12-19 01:30:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 181 [2023-12-19 01:30:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:31,753 INFO L225 Difference]: With dead ends: 19159 [2023-12-19 01:30:31,753 INFO L226 Difference]: Without dead ends: 11009 [2023-12-19 01:30:31,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:31,768 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 92 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:31,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2023-12-19 01:30:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 10964. [2023-12-19 01:30:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10964 states, 9228 states have (on average 1.1870394451668833) internal successors, (10954), 9306 states have internal predecessors, (10954), 955 states have call successors, (955), 724 states have call predecessors, (955), 780 states have return successors, (1326), 937 states have call predecessors, (1326), 955 states have call successors, (1326) [2023-12-19 01:30:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 13235 transitions. [2023-12-19 01:30:32,278 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 13235 transitions. Word has length 181 [2023-12-19 01:30:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:32,279 INFO L495 AbstractCegarLoop]: Abstraction has 10964 states and 13235 transitions. [2023-12-19 01:30:32,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-19 01:30:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 13235 transitions. [2023-12-19 01:30:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 01:30:32,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:32,287 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:32,295 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-19 01:30:32,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:32,493 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:32,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1422560057, now seen corresponding path program 1 times [2023-12-19 01:30:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290743797] [2023-12-19 01:30:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:30:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:30:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:30:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:30:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290743797] [2023-12-19 01:30:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290743797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686259659] [2023-12-19 01:30:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:32,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:32,585 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-19 01:30:32,608 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-19 01:30:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:30:32,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-19 01:30:32,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686259659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:30:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620235895] [2023-12-19 01:30:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:30:32,754 INFO L87 Difference]: Start difference. First operand 10964 states and 13235 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:33,365 INFO L93 Difference]: Finished difference Result 21916 states and 26716 transitions. [2023-12-19 01:30:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:30:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-19 01:30:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:33,392 INFO L225 Difference]: With dead ends: 21916 [2023-12-19 01:30:33,392 INFO L226 Difference]: Without dead ends: 10964 [2023-12-19 01:30:33,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:30:33,411 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 165 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:33,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 233 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2023-12-19 01:30:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10964. [2023-12-19 01:30:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10964 states, 9228 states have (on average 1.1540962288686607) internal successors, (10650), 9306 states have internal predecessors, (10650), 955 states have call successors, (955), 724 states have call predecessors, (955), 780 states have return successors, (1326), 937 states have call predecessors, (1326), 955 states have call successors, (1326) [2023-12-19 01:30:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 12931 transitions. [2023-12-19 01:30:33,966 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 12931 transitions. Word has length 183 [2023-12-19 01:30:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:33,966 INFO L495 AbstractCegarLoop]: Abstraction has 10964 states and 12931 transitions. [2023-12-19 01:30:33,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 12931 transitions. [2023-12-19 01:30:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 01:30:33,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:33,975 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:33,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:34,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:34,181 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:34,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash -996005559, now seen corresponding path program 1 times [2023-12-19 01:30:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893307012] [2023-12-19 01:30:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:30:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:30:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:30:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:30:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893307012] [2023-12-19 01:30:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893307012] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157646716] [2023-12-19 01:30:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:34,272 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-19 01:30:34,275 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-19 01:30:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:34,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:30:34,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-19 01:30:34,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157646716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:30:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599953590] [2023-12-19 01:30:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:34,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:30:34,441 INFO L87 Difference]: Start difference. First operand 10964 states and 12931 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:34,992 INFO L93 Difference]: Finished difference Result 16488 states and 19654 transitions. [2023-12-19 01:30:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:30:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-19 01:30:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:35,015 INFO L225 Difference]: With dead ends: 16488 [2023-12-19 01:30:35,015 INFO L226 Difference]: Without dead ends: 8873 [2023-12-19 01:30:35,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:30:35,028 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 161 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:35,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 226 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2023-12-19 01:30:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6824. [2023-12-19 01:30:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 5756 states have (on average 1.1320361362056983) internal successors, (6516), 5794 states have internal predecessors, (6516), 599 states have call successors, (599), 444 states have call predecessors, (599), 468 states have return successors, (807), 587 states have call predecessors, (807), 599 states have call successors, (807) [2023-12-19 01:30:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 7922 transitions. [2023-12-19 01:30:35,381 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 7922 transitions. Word has length 183 [2023-12-19 01:30:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:35,381 INFO L495 AbstractCegarLoop]: Abstraction has 6824 states and 7922 transitions. [2023-12-19 01:30:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 7922 transitions. [2023-12-19 01:30:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 01:30:35,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:35,386 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:30:35,392 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-19 01:30:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:35,592 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:35,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -657718009, now seen corresponding path program 1 times [2023-12-19 01:30:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538337590] [2023-12-19 01:30:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:30:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:30:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:30:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:30:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538337590] [2023-12-19 01:30:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538337590] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034810468] [2023-12-19 01:30:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:35,661 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-19 01:30:35,663 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-19 01:30:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:30:35,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-12-19 01:30:35,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034810468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:35,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:35,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:30:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486394462] [2023-12-19 01:30:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:35,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:35,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:35,785 INFO L87 Difference]: Start difference. First operand 6824 states and 7922 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:35,984 INFO L93 Difference]: Finished difference Result 9723 states and 11306 transitions. [2023-12-19 01:30:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:30:35,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 183 [2023-12-19 01:30:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:35,987 INFO L225 Difference]: With dead ends: 9723 [2023-12-19 01:30:35,987 INFO L226 Difference]: Without dead ends: 1918 [2023-12-19 01:30:35,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:35,995 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 422 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-19 01:30:35,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 422 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2023-12-19 01:30:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2023-12-19 01:30:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1613 states have (on average 1.1035337879727216) internal successors, (1780), 1625 states have internal predecessors, (1780), 174 states have call successors, (174), 122 states have call predecessors, (174), 130 states have return successors, (189), 171 states have call predecessors, (189), 174 states have call successors, (189) [2023-12-19 01:30:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2143 transitions. [2023-12-19 01:30:36,091 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2143 transitions. Word has length 183 [2023-12-19 01:30:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:36,091 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2143 transitions. [2023-12-19 01:30:36,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:30:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2143 transitions. [2023-12-19 01:30:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 01:30:36,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:36,093 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 01:30:36,101 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-19 01:30:36,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:36,294 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:36,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 677916105, now seen corresponding path program 1 times [2023-12-19 01:30:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730433214] [2023-12-19 01:30:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:30:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:30:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:30:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:30:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:30:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:30:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730433214] [2023-12-19 01:30:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730433214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641222549] [2023-12-19 01:30:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:36,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:36,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:36,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:36,443 INFO L87 Difference]: Start difference. First operand 1918 states and 2143 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:30:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:37,157 INFO L93 Difference]: Finished difference Result 2141 states and 2384 transitions. [2023-12-19 01:30:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:30:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 183 [2023-12-19 01:30:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:37,158 INFO L225 Difference]: With dead ends: 2141 [2023-12-19 01:30:37,158 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 01:30:37,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:30:37,160 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 631 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:37,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 631 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:30:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 01:30:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 01:30:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 01:30:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 01:30:37,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-12-19 01:30:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:37,161 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 01:30:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:30:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 01:30:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 01:30:37,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:30:37,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:30:37,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 01:30:37,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 01:31:20,008 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2023-12-19 01:31:20,008 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 820 830) the Hoare annotation is: (let ((.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse23 (< 0 ~t1_pc~0)) (.cse24 (< ~E_1~0 2)) (.cse15 (not (= ~t2_pc~0 1))) (.cse20 (< |old(~m_st~0)| 2)) (.cse0 (< ~T1_E~0 2)) (.cse2 (< ~E_2~0 2)) (.cse3 (and .cse25 (= ~m_st~0 |old(~m_st~0)|) .cse26)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (not (= ~t1_pc~0 1))) (.cse18 (= ~m_pc~0 1)) (.cse14 (< ~T2_E~0 2)) (.cse17 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse7 (< ~E_M~0 2)) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse19 (< 0 ~t2_pc~0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse16) (or .cse1 .cse3 .cse4 .cse8 .cse10 .cse11 .cse18 .cse12 .cse13 .cse20 .cse16 .cse21) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse19 .cse24 .cse14 .cse16 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse24 .cse14 .cse15 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse21) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse24 .cse14 .cse15 .cse16) (or .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse19 .cse16 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse14 .cse16 .cse17) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) (and .cse25 (= ~m_st~0 0) .cse26) .cse4 .cse7 .cse8 .cse9 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse10 .cse11 .cse12 .cse13 .cse19 (not (= |old(~m_st~0)| 0)) .cse16 .cse21)))) [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse2 (and .cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (= ~m_pc~0 1)) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (= ~E_2~0 0)) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= ~c_dr_pc~0 0))) (.cse12 (and .cse13 (= ~c_dr_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2) .cse8) (or .cse0 .cse1 (not (= ~p_num_write~0 1)) .cse9 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8) (or .cse11 .cse9 .cse12)))) [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-19 01:31:20,011 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-19 01:31:20,012 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-19 01:31:20,014 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 713 746) no Hoare annotation was computed. [2023-12-19 01:31:20,019 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 713 746) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 710 747) the Hoare annotation is: (let ((.cse5 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse23 (= ~m_pc~0 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse22 (< ~m_st~0 2)) (.cse0 (< ~t1_st~0 2)) (.cse12 (< 0 ~t2_pc~0)) (.cse25 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse24 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~E_M~0)| 2)) (.cse13 (< |old(~T2_E~0)| 2)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (< ~t2_st~0 2)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (< |old(~T1_E~0)| 2)) (.cse18 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 (= |old(~E_2~0)| 0) .cse16 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse17 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19))) [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 713 746) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L724-1(lines 713 746) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L714-1(lines 713 746) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 710 747) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 803 807) no Hoare annotation was computed. [2023-12-19 01:31:20,020 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L585(lines 573 587) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L566(lines 554 568) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 786 819) the Hoare annotation is: (let ((.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse26 (not (= ~m_pc~0 ~t1_pc~0))) (.cse28 (not (= (+ ~local~0 1) ~token~0))) (.cse4 (not (= ~token~0 (+ 2 ~local~0)))) (.cse27 (< 0 ~t1_pc~0)) (.cse24 (< |old(~m_st~0)| 2)) (.cse16 (< ~E_1~0 2)) (.cse18 (not (= ~t2_pc~0 1))) (.cse0 (< ~T1_E~0 2)) (.cse3 (< ~E_2~0 2)) (.cse20 (and .cse29 (= ~m_st~0 |old(~m_st~0)|) .cse30)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (not (= ~t1_pc~0 1))) (.cse22 (= ~m_pc~0 1)) (.cse17 (< ~T2_E~0 2)) (.cse21 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse29 (= ~m_st~0 0) .cse30)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse8 (< ~E_M~0 2)) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (< |old(~t2_st~0)| 2)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse23 (< 0 ~t2_pc~0)) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse21) (or .cse1 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse23 .cse19) (or .cse1 .cse20 .cse5 .cse9 .cse11 .cse12 .cse22 .cse13 .cse14 .cse24 .cse19 .cse25) (or .cse0 .cse26 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse23 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse16 .cse17 .cse19 .cse25) (or .cse0 .cse1 .cse20 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse28 .cse19 .cse25) (or .cse0 .cse26 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse28 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse3 .cse20 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse16 .cse17 .cse19) (or .cse1 .cse20 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse23 .cse19 .cse25) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse22 .cse13 .cse14 .cse23 .cse17 .cse19 .cse21) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse5 .cse8 .cse9 .cse10 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse19 .cse25)))) [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L811-2(lines 786 819) no Hoare annotation was computed. [2023-12-19 01:31:20,021 INFO L899 garLoopResultBuilder]: For program point L547(lines 535 549) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2023-12-19 01:31:20,022 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L895-1(line 895) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L664-2(lines 664 671) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-19 01:31:20,022 INFO L899 garLoopResultBuilder]: For program point L897(lines 897 902) no Hoare annotation was computed. [2023-12-19 01:31:20,023 INFO L899 garLoopResultBuilder]: For program point L864-1(lines 843 876) no Hoare annotation was computed. [2023-12-19 01:31:20,023 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 460 495) no Hoare annotation was computed. [2023-12-19 01:31:20,023 INFO L895 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,023 INFO L899 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2023-12-19 01:31:20,023 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 605) no Hoare annotation was computed. [2023-12-19 01:31:20,024 INFO L899 garLoopResultBuilder]: For program point L601-2(lines 600 618) no Hoare annotation was computed. [2023-12-19 01:31:20,024 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 507) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L895 garLoopResultBuilder]: At program point L437(line 437) the Hoare annotation is: (let ((.cse5 (not (= ~m_pc~0 1))) (.cse12 (<= ~t2_pc~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse20 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse19 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse20 .cse8 .cse9 .cse10 .cse17 .cse11) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse19 .cse16 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11))) [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 908 966) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 416 459) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-19 01:31:20,025 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse1 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 (= ~p_num_write~0 1) .cse8 .cse9 .cse10))) [2023-12-19 01:31:20,025 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-19 01:31:20,026 INFO L895 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,026 INFO L895 garLoopResultBuilder]: At program point L935-1(line 935) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,026 INFO L899 garLoopResultBuilder]: For program point L869-1(lines 840 877) no Hoare annotation was computed. [2023-12-19 01:31:20,026 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-19 01:31:20,026 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-19 01:31:20,026 INFO L895 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,026 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 645 709) no Hoare annotation was computed. [2023-12-19 01:31:20,026 INFO L899 garLoopResultBuilder]: For program point L606-1(lines 600 618) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L895 garLoopResultBuilder]: At program point L937(line 937) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point L904(lines 893 906) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L895 garLoopResultBuilder]: At program point L475-1(lines 475 488) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse18 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~token~0 ~local~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10) (and (= ~t1_pc~0 1) .cse0 .cse13 .cse14 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse15 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse4 .cse18 .cse17 .cse5 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse19 .cse11))) [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 496 531) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point L675-1(lines 651 703) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L899 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2023-12-19 01:31:20,027 INFO L895 garLoopResultBuilder]: At program point L511-1(lines 511 524) the Hoare annotation is: (let ((.cse10 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (<= 2 ~E_M~0)) (.cse16 (= ~m_st~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse20 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse16 .cse17 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse11 .cse12 (= ~t2_pc~0 1) (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse16 .cse17 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18))) [2023-12-19 01:31:20,027 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 431 452) the Hoare annotation is: (let ((.cse5 (not (= ~m_pc~0 1))) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse12 (<= ~t2_pc~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (<= 2 ~E_1~0)) (.cse16 (<= 2 ~T2_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse17 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse18 (= ~t2_pc~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse11) (and .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse20 .cse4 .cse6 .cse21 .cse17 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12) (and .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse20 .cse4 .cse6 .cse21 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse18 (= ~token~0 (+ 2 ~local~0)) .cse8 .cse9 .cse10 .cse11))) [2023-12-19 01:31:20,027 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L611-1(lines 597 619) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 951) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L678-2(lines 678 685) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L844(lines 844 848) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L844-2(lines 843 876) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-19 01:31:20,028 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L895 garLoopResultBuilder]: At program point L946(line 946) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L946-1(line 946) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (not (= ~E_2~0 0)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~E_1~0 2) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (let ((.cse16 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0))) (.cse15 (<= 2 ~t2_st~0)) (.cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (not (= ~E_2~0 0))) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t2_pc~0 1) .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18) (and .cse1 .cse4 .cse5 .cse6 .cse7 (= ~m_st~0 0) .cse16 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18))) [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 984) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L849-1(lines 843 876) no Hoare annotation was computed. [2023-12-19 01:31:20,029 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2023-12-19 01:31:20,030 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-12-19 01:31:20,030 INFO L899 garLoopResultBuilder]: For program point L916-1(line 916) no Hoare annotation was computed. [2023-12-19 01:31:20,030 INFO L895 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 01:31:20,030 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-19 01:31:20,030 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 (<= 2 ~E_1~0) (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~token~0 (+ 2 ~local~0)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 (not (= ~E_2~0 0)) .cse6 .cse7 .cse8))) [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse6 (not (= ~m_pc~0 1))) (.cse11 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9 .cse10) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10))) [2023-12-19 01:31:20,031 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,031 INFO L895 garLoopResultBuilder]: At program point L918-1(line 918) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-19 01:31:20,031 INFO L895 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: (let ((.cse1 (<= 2 ~T2_E~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~E_2~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~t2_st~0) .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse8 (<= 2 ~m_st~0) (not (= ~E_2~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,031 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L854-1(lines 843 876) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L895 garLoopResultBuilder]: At program point L689-1(lines 651 703) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L895 garLoopResultBuilder]: At program point L923-1(lines 923 960) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse23 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse23 .cse9 .cse20 (not (= ~E_2~0 0)) .cse13 .cse14 .cse15) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2023-12-19 01:31:20,032 INFO L899 garLoopResultBuilder]: For program point L692-2(lines 692 699) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 445 451) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L859-1(lines 843 876) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L661-1(lines 651 703) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~q_free~0 0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse13 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~p_dw_st~0 0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse1 .cse18 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse1 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 .cse17 .cse8 .cse9 .cse11))) [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-19 01:31:20,033 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (= ~E_2~0 0))) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse5 (= ~q_free~0 0) .cse6 .cse8 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10))) [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L641(lines 623 643) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 637) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 638) no Hoare annotation was computed. [2023-12-19 01:31:20,033 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 639) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 644) the Hoare annotation is: true [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 751 784) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 751 784) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 748 785) the Hoare annotation is: (let ((.cse5 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse23 (= ~m_pc~0 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse22 (< ~m_st~0 2)) (.cse0 (< ~t1_st~0 2)) (.cse12 (< 0 ~t2_pc~0)) (.cse25 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse24 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~E_M~0)| 2)) (.cse13 (< |old(~T2_E~0)| 2)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (< ~t2_st~0 2)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (< |old(~T1_E~0)| 2)) (.cse18 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse23 .cse8 .cse9 (= |old(~E_2~0)| 0) .cse16 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse20 (not (= (+ ~local~0 1) ~token~0)) .cse16 .cse17 .cse18) (or .cse1 .cse24 .cse2 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse25 .cse1 .cse24 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse17 .cse18 .cse19))) [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L777-1(lines 748 785) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 751 784) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L757-1(lines 751 784) no Hoare annotation was computed. [2023-12-19 01:31:20,034 INFO L899 garLoopResultBuilder]: For program point L772-1(lines 751 784) no Hoare annotation was computed. [2023-12-19 01:31:20,037 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-19 01:31:20,039 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:31:20,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:31:20 BoogieIcfgContainer [2023-12-19 01:31:20,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:31:20,094 INFO L158 Benchmark]: Toolchain (without parser) took 78295.75ms. Allocated memory was 220.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 166.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-12-19 01:31:20,094 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:31:20,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.72ms. Allocated memory is still 220.2MB. Free memory was 166.2MB in the beginning and 148.9MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 01:31:20,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.45ms. Allocated memory is still 220.2MB. Free memory was 148.9MB in the beginning and 145.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:31:20,095 INFO L158 Benchmark]: Boogie Preprocessor took 45.93ms. Allocated memory is still 220.2MB. Free memory was 145.7MB in the beginning and 142.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:31:20,095 INFO L158 Benchmark]: RCFGBuilder took 638.74ms. Allocated memory is still 220.2MB. Free memory was 142.6MB in the beginning and 110.1MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-19 01:31:20,095 INFO L158 Benchmark]: TraceAbstraction took 77266.46ms. Allocated memory was 220.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 109.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-19 01:31:20,096 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.11ms. Allocated memory is still 220.2MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.72ms. Allocated memory is still 220.2MB. Free memory was 166.2MB in the beginning and 148.9MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.45ms. Allocated memory is still 220.2MB. Free memory was 148.9MB in the beginning and 145.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.93ms. Allocated memory is still 220.2MB. Free memory was 145.7MB in the beginning and 142.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 638.74ms. Allocated memory is still 220.2MB. Free memory was 142.6MB in the beginning and 110.1MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 77266.46ms. Allocated memory was 220.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 109.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.6GB. 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: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 10 procedures, 181 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 77.1s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9455 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9226 mSDsluCounter, 15584 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9230 mSDsCounter, 1087 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11009 IncrementalHoareTripleChecker+Invalid, 12096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1087 mSolverCounterUnsat, 6354 mSDtfsCounter, 11009 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3279 GetRequests, 3035 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18579occurred in iteration=24, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 7339 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 12085 PreInvPairs, 13328 NumberOfFragments, 18556 HoareAnnotationTreeSize, 12085 FormulaSimplifications, 36744 FormulaSimplificationTreeSizeReduction, 14.7s HoareSimplificationTime, 39 FormulaSimplificationsInter, 171445 FormulaSimplificationTreeSizeReductionInter, 27.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5828 NumberOfCodeBlocks, 5828 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5897 ConstructedInterpolants, 0 QuantifiedInterpolants, 10016 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8650 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3122/3474 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 2 specifications checked. All of them hold - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 651]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (t2_pc <= 0))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2) && (c_dr_pc == 0)) || (((((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 0))) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((E_2 == 0))) && (p_dw_st == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && !((E_2 == 0))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (2 <= E_2)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) RESULT: Ultimate proved your program to be correct! [2023-12-19 01:31:20,119 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...