/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/Problem05_label46+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:24:59,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:25:00,064 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-18 22:25:00,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:25:00,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:25:00,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:25:00,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:25:00,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:25:00,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:25:00,083 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:25:00,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:25:00,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:25:00,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:25:00,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:25:00,085 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:25:00,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:25:00,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:25:00,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:25:00,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:25:00,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:25:00,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:25:00,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:25:00,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:25:00,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:25:00,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:25:00,087 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:25:00,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:25:00,088 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:25:00,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:25:00,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:25:00,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:25:00,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:25:00,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:25:00,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:25:00,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:25:00,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:25:00,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:25:00,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:25:00,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:25:00,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:25:00,090 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:25:00,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:25:00,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:25:00,092 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-18 22:25:00,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:25:00,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:25:00,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:25:00,304 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:25:00,305 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:25:00,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label46+token_ring.02.cil-2.c [2023-12-18 22:25:01,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:25:01,793 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:25:01,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.02.cil-2.c [2023-12-18 22:25:01,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41a6db31/ae344dec885740cd99e751963864347d/FLAGaae0a633e [2023-12-18 22:25:01,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41a6db31/ae344dec885740cd99e751963864347d [2023-12-18 22:25:01,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:25:01,850 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:25:01,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:25:01,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:25:01,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:25:01,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:25:01" (1/1) ... [2023-12-18 22:25:01,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a4d7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:01, skipping insertion in model container [2023-12-18 22:25:01,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:25:01" (1/1) ... [2023-12-18 22:25:02,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:25:03,273 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/Problem05_label46+token_ring.02.cil-2.c[382357,382370] [2023-12-18 22:25:03,295 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/Problem05_label46+token_ring.02.cil-2.c[383339,383352] [2023-12-18 22:25:03,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:25:03,432 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:25:04,001 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/Problem05_label46+token_ring.02.cil-2.c[382357,382370] [2023-12-18 22:25:04,006 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/Problem05_label46+token_ring.02.cil-2.c[383339,383352] [2023-12-18 22:25:04,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:25:04,064 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:25:04,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04 WrapperNode [2023-12-18 22:25:04,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:25:04,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:25:04,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:25:04,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:25:04,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,539 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12639 [2023-12-18 22:25:04,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:25:04,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:25:04,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:25:04,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:25:04,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,693 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-18 22:25:04,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:04,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:05,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:25:05,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:25:05,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:25:05,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:25:05,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (1/1) ... [2023-12-18 22:25:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:25:05,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:05,091 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-18 22:25:05,096 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-18 22:25:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-18 22:25:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-18 22:25:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-18 22:25:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:25:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-18 22:25:05,124 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-18 22:25:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:25:05,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:25:05,240 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:25:05,242 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:25:10,993 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:25:11,087 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:25:11,087 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-18 22:25:11,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:25:11 BoogieIcfgContainer [2023-12-18 22:25:11,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:25:11,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:25:11,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:25:11,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:25:11,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:25:01" (1/3) ... [2023-12-18 22:25:11,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d94729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:25:11, skipping insertion in model container [2023-12-18 22:25:11,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:25:04" (2/3) ... [2023-12-18 22:25:11,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d94729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:25:11, skipping insertion in model container [2023-12-18 22:25:11,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:25:11" (3/3) ... [2023-12-18 22:25:11,096 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.02.cil-2.c [2023-12-18 22:25:11,109 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:25:11,109 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:25:11,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:25:11,183 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;@3103e947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:25:11,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:25:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-18 22:25:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:11,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:11,206 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, 1] [2023-12-18 22:25:11,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:11,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1931990387, now seen corresponding path program 1 times [2023-12-18 22:25:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311199888] [2023-12-18 22:25:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:11,634 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-18 22:25:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311199888] [2023-12-18 22:25:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311199888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:25:11,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823279087] [2023-12-18 22:25:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:11,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:25:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:25:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:25:11,670 INFO L87 Difference]: Start difference. First operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:12,380 INFO L93 Difference]: Finished difference Result 4665 states and 8728 transitions. [2023-12-18 22:25:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:25:12,383 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:12,406 INFO L225 Difference]: With dead ends: 4665 [2023-12-18 22:25:12,407 INFO L226 Difference]: Without dead ends: 2418 [2023-12-18 22:25:12,416 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-18 22:25:12,421 INFO L413 NwaCegarLoop]: 4068 mSDtfsCounter, 4366 mSDsluCounter, 12180 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4375 SdHoareTripleChecker+Valid, 16248 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:12,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4375 Valid, 16248 Invalid, 704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-18 22:25:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2023-12-18 22:25:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2357. [2023-12-18 22:25:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2313 states have (on average 1.8408992650237785) internal successors, (4258), 2317 states have internal predecessors, (4258), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-12-18 22:25:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4317 transitions. [2023-12-18 22:25:12,547 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4317 transitions. Word has length 62 [2023-12-18 22:25:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:12,548 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4317 transitions. [2023-12-18 22:25:12,548 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4317 transitions. [2023-12-18 22:25:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:12,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:12,555 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, 1] [2023-12-18 22:25:12,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 22:25:12,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:12,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash -230609229, now seen corresponding path program 1 times [2023-12-18 22:25:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:12,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22899088] [2023-12-18 22:25:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:12,673 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-18 22:25:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22899088] [2023-12-18 22:25:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22899088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:25:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643971659] [2023-12-18 22:25:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:12,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:25:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:25:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:12,676 INFO L87 Difference]: Start difference. First operand 2357 states and 4317 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:13,674 INFO L93 Difference]: Finished difference Result 2788 states and 4980 transitions. [2023-12-18 22:25:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:25:13,675 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:13,684 INFO L225 Difference]: With dead ends: 2788 [2023-12-18 22:25:13,684 INFO L226 Difference]: Without dead ends: 2560 [2023-12-18 22:25:13,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-18 22:25:13,687 INFO L413 NwaCegarLoop]: 4143 mSDtfsCounter, 4356 mSDsluCounter, 16397 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4365 SdHoareTripleChecker+Valid, 20540 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:13,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4365 Valid, 20540 Invalid, 1067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-18 22:25:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-12-18 22:25:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2463. [2023-12-18 22:25:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2401 states have (on average 1.82923781757601) internal successors, (4392), 2406 states have internal predecessors, (4392), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-18 22:25:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4475 transitions. [2023-12-18 22:25:13,738 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4475 transitions. Word has length 62 [2023-12-18 22:25:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:13,739 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 4475 transitions. [2023-12-18 22:25:13,739 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4475 transitions. [2023-12-18 22:25:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:13,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:13,740 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, 1] [2023-12-18 22:25:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 22:25:13,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:13,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -711689487, now seen corresponding path program 1 times [2023-12-18 22:25:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793876553] [2023-12-18 22:25:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:13,951 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-18 22:25:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793876553] [2023-12-18 22:25:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793876553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:13,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:13,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:25:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025624382] [2023-12-18 22:25:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:13,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:25:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:25:13,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:13,953 INFO L87 Difference]: Start difference. First operand 2463 states and 4475 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:14,568 INFO L93 Difference]: Finished difference Result 3161 states and 5546 transitions. [2023-12-18 22:25:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:25:14,569 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:14,579 INFO L225 Difference]: With dead ends: 3161 [2023-12-18 22:25:14,579 INFO L226 Difference]: Without dead ends: 2827 [2023-12-18 22:25:14,581 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-18 22:25:14,583 INFO L413 NwaCegarLoop]: 4073 mSDtfsCounter, 4394 mSDsluCounter, 16214 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 20287 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:14,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 20287 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-18 22:25:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2023-12-18 22:25:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2676. [2023-12-18 22:25:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2578 states have (on average 1.8079906904577192) internal successors, (4661), 2585 states have internal predecessors, (4661), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2023-12-18 22:25:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4796 transitions. [2023-12-18 22:25:14,646 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4796 transitions. Word has length 62 [2023-12-18 22:25:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:14,647 INFO L495 AbstractCegarLoop]: Abstraction has 2676 states and 4796 transitions. [2023-12-18 22:25:14,647 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4796 transitions. [2023-12-18 22:25:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:14,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:14,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, 1] [2023-12-18 22:25:14,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 22:25:14,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:14,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash -727208205, now seen corresponding path program 1 times [2023-12-18 22:25:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425048778] [2023-12-18 22:25:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:14,746 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-18 22:25:14,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425048778] [2023-12-18 22:25:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425048778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:25:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561892230] [2023-12-18 22:25:14,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:14,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:25:14,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:14,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:25:14,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:14,748 INFO L87 Difference]: Start difference. First operand 2676 states and 4796 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:15,606 INFO L93 Difference]: Finished difference Result 3963 states and 6765 transitions. [2023-12-18 22:25:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:25:15,607 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:15,618 INFO L225 Difference]: With dead ends: 3963 [2023-12-18 22:25:15,618 INFO L226 Difference]: Without dead ends: 3416 [2023-12-18 22:25:15,620 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-18 22:25:15,620 INFO L413 NwaCegarLoop]: 4138 mSDtfsCounter, 4364 mSDsluCounter, 16389 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4372 SdHoareTripleChecker+Valid, 20527 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:15,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4372 Valid, 20527 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-18 22:25:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-12-18 22:25:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3060. [2023-12-18 22:25:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2894 states have (on average 1.7736696613683482) internal successors, (5133), 2905 states have internal predecessors, (5133), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2023-12-18 22:25:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 5370 transitions. [2023-12-18 22:25:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 5370 transitions. Word has length 62 [2023-12-18 22:25:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:15,687 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 5370 transitions. [2023-12-18 22:25:15,687 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 5370 transitions. [2023-12-18 22:25:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:15,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:15,688 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, 1] [2023-12-18 22:25:15,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-18 22:25:15,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:15,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1080296587, now seen corresponding path program 1 times [2023-12-18 22:25:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:15,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898307133] [2023-12-18 22:25:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:15,763 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-18 22:25:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898307133] [2023-12-18 22:25:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898307133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:25:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319131964] [2023-12-18 22:25:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:15,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:25:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:25:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:15,765 INFO L87 Difference]: Start difference. First operand 3060 states and 5370 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:16,478 INFO L93 Difference]: Finished difference Result 5261 states and 8705 transitions. [2023-12-18 22:25:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:25:16,479 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:16,495 INFO L225 Difference]: With dead ends: 5261 [2023-12-18 22:25:16,495 INFO L226 Difference]: Without dead ends: 4330 [2023-12-18 22:25:16,498 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-18 22:25:16,499 INFO L413 NwaCegarLoop]: 4139 mSDtfsCounter, 4364 mSDsluCounter, 16392 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4376 SdHoareTripleChecker+Valid, 20531 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:16,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4376 Valid, 20531 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-18 22:25:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2023-12-18 22:25:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3865. [2023-12-18 22:25:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 3567 states have (on average 1.7244182786655453) internal successors, (6151), 3586 states have internal predecessors, (6151), 178 states have call successors, (178), 103 states have call predecessors, (178), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2023-12-18 22:25:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 6602 transitions. [2023-12-18 22:25:16,592 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 6602 transitions. Word has length 62 [2023-12-18 22:25:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:16,592 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 6602 transitions. [2023-12-18 22:25:16,592 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 6602 transitions. [2023-12-18 22:25:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:25:16,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:16,594 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, 1] [2023-12-18 22:25:16,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 22:25:16,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:16,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 847976115, now seen corresponding path program 1 times [2023-12-18 22:25:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652305388] [2023-12-18 22:25:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:16,668 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-18 22:25:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652305388] [2023-12-18 22:25:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652305388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:25:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539557386] [2023-12-18 22:25:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:16,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:25:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:25:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:25:16,670 INFO L87 Difference]: Start difference. First operand 3865 states and 6602 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:17,339 INFO L93 Difference]: Finished difference Result 7007 states and 11395 transitions. [2023-12-18 22:25:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:25:17,339 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-18 22:25:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:17,356 INFO L225 Difference]: With dead ends: 7007 [2023-12-18 22:25:17,357 INFO L226 Difference]: Without dead ends: 5272 [2023-12-18 22:25:17,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-18 22:25:17,363 INFO L413 NwaCegarLoop]: 4153 mSDtfsCounter, 4486 mSDsluCounter, 12194 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 16347 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:17,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 16347 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-18 22:25:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2023-12-18 22:25:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4737. [2023-12-18 22:25:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4737 states, 4281 states have (on average 1.6783461807988789) internal successors, (7185), 4317 states have internal predecessors, (7185), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2023-12-18 22:25:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 7856 transitions. [2023-12-18 22:25:17,488 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 7856 transitions. Word has length 62 [2023-12-18 22:25:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:17,488 INFO L495 AbstractCegarLoop]: Abstraction has 4737 states and 7856 transitions. [2023-12-18 22:25:17,489 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-18 22:25:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 7856 transitions. [2023-12-18 22:25:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-18 22:25:17,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:17,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:17,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-18 22:25:17,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:17,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1849177786, now seen corresponding path program 1 times [2023-12-18 22:25:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443744669] [2023-12-18 22:25:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-18 22:25:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 22:25:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443744669] [2023-12-18 22:25:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443744669] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408907554] [2023-12-18 22:25:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:17,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:17,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:17,725 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-18 22:25:17,754 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-18 22:25:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:17,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:17,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:17,861 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-18 22:25:17,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408907554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-18 22:25:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762657085] [2023-12-18 22:25:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:17,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:17,863 INFO L87 Difference]: Start difference. First operand 4737 states and 7856 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-18 22:25:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:18,009 INFO L93 Difference]: Finished difference Result 9834 states and 15520 transitions. [2023-12-18 22:25:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:18,011 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-18 22:25:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:18,044 INFO L225 Difference]: With dead ends: 9834 [2023-12-18 22:25:18,044 INFO L226 Difference]: Without dead ends: 7227 [2023-12-18 22:25:18,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-18 22:25:18,054 INFO L413 NwaCegarLoop]: 4126 mSDtfsCounter, 4104 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 4278 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-18 22:25:18,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 4278 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2023-12-18 22:25:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7197. [2023-12-18 22:25:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7197 states, 6327 states have (on average 1.6146672988778252) internal successors, (10216), 6396 states have internal predecessors, (10216), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2023-12-18 22:25:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 11473 transitions. [2023-12-18 22:25:18,257 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 11473 transitions. Word has length 100 [2023-12-18 22:25:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:18,257 INFO L495 AbstractCegarLoop]: Abstraction has 7197 states and 11473 transitions. [2023-12-18 22:25:18,258 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-18 22:25:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 11473 transitions. [2023-12-18 22:25:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-18 22:25:18,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:18,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:18,278 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-18 22:25:18,475 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-18 22:25:18,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:18,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1616599654, now seen corresponding path program 1 times [2023-12-18 22:25:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771846282] [2023-12-18 22:25:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-18 22:25:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-18 22:25:18,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771846282] [2023-12-18 22:25:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771846282] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661297335] [2023-12-18 22:25:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:18,713 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-18 22:25:18,746 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-18 22:25:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:18,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:18,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:18,903 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-18 22:25:18,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661297335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:18,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:18,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008158023] [2023-12-18 22:25:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:18,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:18,919 INFO L87 Difference]: Start difference. First operand 7197 states and 11473 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:25:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:19,202 INFO L93 Difference]: Finished difference Result 16951 states and 26175 transitions. [2023-12-18 22:25:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:19,202 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2023-12-18 22:25:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:19,240 INFO L225 Difference]: With dead ends: 16951 [2023-12-18 22:25:19,241 INFO L226 Difference]: Without dead ends: 11885 [2023-12-18 22:25:19,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-18 22:25:19,259 INFO L413 NwaCegarLoop]: 4267 mSDtfsCounter, 145 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8393 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:19,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8393 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 22:25:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2023-12-18 22:25:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 11885. [2023-12-18 22:25:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11885 states, 10202 states have (on average 1.5544991178200354) internal successors, (15859), 10320 states have internal predecessors, (15859), 977 states have call successors, (977), 609 states have call predecessors, (977), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2023-12-18 22:25:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 18432 transitions. [2023-12-18 22:25:19,735 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 18432 transitions. Word has length 100 [2023-12-18 22:25:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:19,735 INFO L495 AbstractCegarLoop]: Abstraction has 11885 states and 18432 transitions. [2023-12-18 22:25:19,736 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:25:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 18432 transitions. [2023-12-18 22:25:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-18 22:25:19,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:19,758 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-18 22:25:19,764 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-18 22:25:19,965 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,SelfDestructingSolverStorable7 [2023-12-18 22:25:19,965 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:19,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash -443554109, now seen corresponding path program 1 times [2023-12-18 22:25:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588339813] [2023-12-18 22:25:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-18 22:25:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-18 22:25:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-18 22:25:20,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588339813] [2023-12-18 22:25:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588339813] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:20,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088518050] [2023-12-18 22:25:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:20,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:20,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:20,068 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-18 22:25:20,088 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-18 22:25:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:20,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:20,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-18 22:25:20,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088518050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-18 22:25:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140382892] [2023-12-18 22:25:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:20,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:20,270 INFO L87 Difference]: Start difference. First operand 11885 states and 18432 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-18 22:25:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:20,951 INFO L93 Difference]: Finished difference Result 31009 states and 47101 transitions. [2023-12-18 22:25:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:20,951 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2023-12-18 22:25:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:21,009 INFO L225 Difference]: With dead ends: 31009 [2023-12-18 22:25:21,009 INFO L226 Difference]: Without dead ends: 21259 [2023-12-18 22:25:21,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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-18 22:25:21,036 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 4065 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4299 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-18 22:25:21,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4299 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2023-12-18 22:25:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21151. [2023-12-18 22:25:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21151 states, 17888 states have (on average 1.5120192307692308) internal successors, (27047), 18120 states have internal predecessors, (27047), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2023-12-18 22:25:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21151 states to 21151 states and 31956 transitions. [2023-12-18 22:25:21,803 INFO L78 Accepts]: Start accepts. Automaton has 21151 states and 31956 transitions. Word has length 128 [2023-12-18 22:25:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:21,803 INFO L495 AbstractCegarLoop]: Abstraction has 21151 states and 31956 transitions. [2023-12-18 22:25:21,803 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-18 22:25:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21151 states and 31956 transitions. [2023-12-18 22:25:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-18 22:25:21,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:21,846 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:21,853 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-18 22:25:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:22,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:22,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -36945596, now seen corresponding path program 1 times [2023-12-18 22:25:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000216424] [2023-12-18 22:25:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-18 22:25:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-18 22:25:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-18 22:25:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-18 22:25:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-18 22:25:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:22,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000216424] [2023-12-18 22:25:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000216424] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:22,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126840567] [2023-12-18 22:25:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:22,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:22,141 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-18 22:25:22,165 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-18 22:25:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:22,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:22,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-18 22:25:22,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126840567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524127304] [2023-12-18 22:25:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:22,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:22,302 INFO L87 Difference]: Start difference. First operand 21151 states and 31956 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-18 22:25:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:22,903 INFO L93 Difference]: Finished difference Result 42211 states and 63898 transitions. [2023-12-18 22:25:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 144 [2023-12-18 22:25:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:22,966 INFO L225 Difference]: With dead ends: 42211 [2023-12-18 22:25:22,967 INFO L226 Difference]: Without dead ends: 23193 [2023-12-18 22:25:23,001 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-18 22:25:23,002 INFO L413 NwaCegarLoop]: 4123 mSDtfsCounter, 4082 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 4151 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-18 22:25:23,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4082 Valid, 4151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23193 states. [2023-12-18 22:25:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23193 to 23193. [2023-12-18 22:25:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23193 states, 19718 states have (on average 1.4555735875849478) internal successors, (28701), 19950 states have internal predecessors, (28701), 1925 states have call successors, (1925), 1357 states have call predecessors, (1925), 1548 states have return successors, (3106), 1917 states have call predecessors, (3106), 1923 states have call successors, (3106) [2023-12-18 22:25:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23193 states to 23193 states and 33732 transitions. [2023-12-18 22:25:23,749 INFO L78 Accepts]: Start accepts. Automaton has 23193 states and 33732 transitions. Word has length 144 [2023-12-18 22:25:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:23,749 INFO L495 AbstractCegarLoop]: Abstraction has 23193 states and 33732 transitions. [2023-12-18 22:25:23,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-18 22:25:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23193 states and 33732 transitions. [2023-12-18 22:25:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-18 22:25:23,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:23,807 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:23,818 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-18 22:25:24,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:24,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:24,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1547018971, now seen corresponding path program 1 times [2023-12-18 22:25:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950160134] [2023-12-18 22:25:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-18 22:25:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-18 22:25:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-18 22:25:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-18 22:25:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-18 22:25:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950160134] [2023-12-18 22:25:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950160134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817612332] [2023-12-18 22:25:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:24,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:24,112 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-18 22:25:24,117 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-18 22:25:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:24,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:24,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-18 22:25:24,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817612332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:24,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946123901] [2023-12-18 22:25:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:24,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:24,263 INFO L87 Difference]: Start difference. First operand 23193 states and 33732 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:24,930 INFO L93 Difference]: Finished difference Result 39048 states and 56092 transitions. [2023-12-18 22:25:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2023-12-18 22:25:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:24,992 INFO L225 Difference]: With dead ends: 39048 [2023-12-18 22:25:24,992 INFO L226 Difference]: Without dead ends: 24517 [2023-12-18 22:25:25,013 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-18 22:25:25,013 INFO L413 NwaCegarLoop]: 4155 mSDtfsCounter, 4079 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:25,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4312 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2023-12-18 22:25:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 24377. [2023-12-18 22:25:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24377 states, 20790 states have (on average 1.431120731120731) internal successors, (29753), 21022 states have internal predecessors, (29753), 1945 states have call successors, (1945), 1449 states have call predecessors, (1945), 1640 states have return successors, (3218), 1937 states have call predecessors, (3218), 1943 states have call successors, (3218) [2023-12-18 22:25:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24377 states to 24377 states and 34916 transitions. [2023-12-18 22:25:25,985 INFO L78 Accepts]: Start accepts. Automaton has 24377 states and 34916 transitions. Word has length 144 [2023-12-18 22:25:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:25,985 INFO L495 AbstractCegarLoop]: Abstraction has 24377 states and 34916 transitions. [2023-12-18 22:25:25,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24377 states and 34916 transitions. [2023-12-18 22:25:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:25:26,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:26,022 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:26,042 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-18 22:25:26,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-18 22:25:26,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:26,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 557859153, now seen corresponding path program 1 times [2023-12-18 22:25:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164949107] [2023-12-18 22:25:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:25:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-18 22:25:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:25:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-18 22:25:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164949107] [2023-12-18 22:25:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164949107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445068730] [2023-12-18 22:25:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:26,395 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-18 22:25:26,399 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-18 22:25:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:26,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:26,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-18 22:25:26,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445068730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068652808] [2023-12-18 22:25:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:26,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:26,516 INFO L87 Difference]: Start difference. First operand 24377 states and 34916 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:27,566 INFO L93 Difference]: Finished difference Result 67691 states and 96134 transitions. [2023-12-18 22:25:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-18 22:25:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:27,681 INFO L225 Difference]: With dead ends: 67691 [2023-12-18 22:25:27,681 INFO L226 Difference]: Without dead ends: 45451 [2023-12-18 22:25:27,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-18 22:25:27,713 INFO L413 NwaCegarLoop]: 4274 mSDtfsCounter, 155 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8395 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:27,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 8395 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45451 states. [2023-12-18 22:25:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45451 to 45407. [2023-12-18 22:25:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45407 states, 38406 states have (on average 1.3971514867468624) internal successors, (53659), 38868 states have internal predecessors, (53659), 3775 states have call successors, (3775), 2841 states have call predecessors, (3775), 3224 states have return successors, (7134), 3761 states have call predecessors, (7134), 3773 states have call successors, (7134) [2023-12-18 22:25:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45407 states to 45407 states and 64568 transitions. [2023-12-18 22:25:29,247 INFO L78 Accepts]: Start accepts. Automaton has 45407 states and 64568 transitions. Word has length 145 [2023-12-18 22:25:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:29,247 INFO L495 AbstractCegarLoop]: Abstraction has 45407 states and 64568 transitions. [2023-12-18 22:25:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45407 states and 64568 transitions. [2023-12-18 22:25:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:25:29,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:29,320 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-18 22:25:29,325 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-18 22:25:29,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:29,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:29,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2138110948, now seen corresponding path program 1 times [2023-12-18 22:25:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479918440] [2023-12-18 22:25:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:25:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:25:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:25:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-18 22:25:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479918440] [2023-12-18 22:25:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479918440] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930550000] [2023-12-18 22:25:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:29,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:29,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:29,634 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-18 22:25:29,662 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-18 22:25:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:29,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:29,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-18 22:25:29,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930550000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60758207] [2023-12-18 22:25:29,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:29,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:29,790 INFO L87 Difference]: Start difference. First operand 45407 states and 64568 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-18 22:25:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:30,978 INFO L93 Difference]: Finished difference Result 73407 states and 105859 transitions. [2023-12-18 22:25:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:30,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 145 [2023-12-18 22:25:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:31,087 INFO L225 Difference]: With dead ends: 73407 [2023-12-18 22:25:31,087 INFO L226 Difference]: Without dead ends: 38659 [2023-12-18 22:25:31,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-18 22:25:31,153 INFO L413 NwaCegarLoop]: 4120 mSDtfsCounter, 4077 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4077 SdHoareTripleChecker+Valid, 4147 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-18 22:25:31,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4077 Valid, 4147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38659 states. [2023-12-18 22:25:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38659 to 28179. [2023-12-18 22:25:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28179 states, 24002 states have (on average 1.3733438880093325) internal successors, (32963), 24244 states have internal predecessors, (32963), 2255 states have call successors, (2255), 1729 states have call predecessors, (2255), 1920 states have return successors, (3778), 2237 states have call predecessors, (3778), 2253 states have call successors, (3778) [2023-12-18 22:25:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 38996 transitions. [2023-12-18 22:25:32,366 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 38996 transitions. Word has length 145 [2023-12-18 22:25:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:32,366 INFO L495 AbstractCegarLoop]: Abstraction has 28179 states and 38996 transitions. [2023-12-18 22:25:32,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-18 22:25:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 38996 transitions. [2023-12-18 22:25:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:25:32,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:32,398 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, 1, 1] [2023-12-18 22:25:32,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-18 22:25:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:32,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:32,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1382369957, now seen corresponding path program 1 times [2023-12-18 22:25:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264597556] [2023-12-18 22:25:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:25:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:25:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:25:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:25:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-18 22:25:32,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264597556] [2023-12-18 22:25:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264597556] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77601445] [2023-12-18 22:25:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:32,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:32,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:32,698 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-18 22:25:32,720 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-18 22:25:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:32,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:32,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:32,807 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-18 22:25:32,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77601445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115308173] [2023-12-18 22:25:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:32,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:32,809 INFO L87 Difference]: Start difference. First operand 28179 states and 38996 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:34,188 INFO L93 Difference]: Finished difference Result 76319 states and 105000 transitions. [2023-12-18 22:25:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:34,188 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-18 22:25:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:34,415 INFO L225 Difference]: With dead ends: 76319 [2023-12-18 22:25:34,415 INFO L226 Difference]: Without dead ends: 50287 [2023-12-18 22:25:34,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-18 22:25:34,449 INFO L413 NwaCegarLoop]: 4268 mSDtfsCounter, 143 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 8385 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:34,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 8385 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50287 states. [2023-12-18 22:25:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50287 to 50283. [2023-12-18 22:25:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50283 states, 42414 states have (on average 1.3403828924411751) internal successors, (56851), 42896 states have internal predecessors, (56851), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-18 22:25:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 69318 transitions. [2023-12-18 22:25:36,436 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 69318 transitions. Word has length 145 [2023-12-18 22:25:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 69318 transitions. [2023-12-18 22:25:36,437 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 69318 transitions. [2023-12-18 22:25:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:25:36,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:36,486 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, 3, 3, 3, 3, 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] [2023-12-18 22:25:36,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-18 22:25:36,691 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,SelfDestructingSolverStorable13 [2023-12-18 22:25:36,692 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:36,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 96420286, now seen corresponding path program 1 times [2023-12-18 22:25:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259390297] [2023-12-18 22:25:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:25:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:25:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:25:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-18 22:25:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259390297] [2023-12-18 22:25:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259390297] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389399900] [2023-12-18 22:25:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:36,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:36,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:36,769 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-18 22:25:36,793 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-18 22:25:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:36,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:36,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-18 22:25:36,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389399900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719211077] [2023-12-18 22:25:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:36,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:36,898 INFO L87 Difference]: Start difference. First operand 50283 states and 69318 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:38,370 INFO L93 Difference]: Finished difference Result 88239 states and 121052 transitions. [2023-12-18 22:25:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2023-12-18 22:25:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:38,497 INFO L225 Difference]: With dead ends: 88239 [2023-12-18 22:25:38,497 INFO L226 Difference]: Without dead ends: 51007 [2023-12-18 22:25:38,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-18 22:25:38,544 INFO L413 NwaCegarLoop]: 4148 mSDtfsCounter, 4096 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:38,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 4299 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51007 states. [2023-12-18 22:25:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51007 to 50283. [2023-12-18 22:25:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50283 states, 42414 states have (on average 1.3318951289668506) internal successors, (56491), 42896 states have internal predecessors, (56491), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-18 22:25:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 68958 transitions. [2023-12-18 22:25:40,482 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 68958 transitions. Word has length 146 [2023-12-18 22:25:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:40,482 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 68958 transitions. [2023-12-18 22:25:40,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 68958 transitions. [2023-12-18 22:25:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:25:40,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:40,534 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:40,544 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-18 22:25:40,744 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,SelfDestructingSolverStorable14 [2023-12-18 22:25:40,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:40,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1662299722, now seen corresponding path program 1 times [2023-12-18 22:25:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240366787] [2023-12-18 22:25:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:25:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-18 22:25:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:25:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-18 22:25:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240366787] [2023-12-18 22:25:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240366787] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328018925] [2023-12-18 22:25:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:40,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:40,845 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-18 22:25:40,854 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-18 22:25:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:40,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:40,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-18 22:25:40,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328018925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215252415] [2023-12-18 22:25:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:40,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:40,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:40,991 INFO L87 Difference]: Start difference. First operand 50283 states and 68958 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:42,676 INFO L93 Difference]: Finished difference Result 87915 states and 120128 transitions. [2023-12-18 22:25:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2023-12-18 22:25:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:42,805 INFO L225 Difference]: With dead ends: 87915 [2023-12-18 22:25:42,805 INFO L226 Difference]: Without dead ends: 51455 [2023-12-18 22:25:42,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-18 22:25:42,850 INFO L413 NwaCegarLoop]: 4157 mSDtfsCounter, 4098 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:42,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 4310 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51455 states. [2023-12-18 22:25:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51455 to 50163. [2023-12-18 22:25:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50163 states, 42294 states have (on average 1.3243249633517757) internal successors, (56011), 42776 states have internal predecessors, (56011), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-18 22:25:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50163 states to 50163 states and 68478 transitions. [2023-12-18 22:25:44,774 INFO L78 Accepts]: Start accepts. Automaton has 50163 states and 68478 transitions. Word has length 146 [2023-12-18 22:25:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:44,774 INFO L495 AbstractCegarLoop]: Abstraction has 50163 states and 68478 transitions. [2023-12-18 22:25:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-18 22:25:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 50163 states and 68478 transitions. [2023-12-18 22:25:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:25:44,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:44,825 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, 3, 3, 3, 3, 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] [2023-12-18 22:25:44,832 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-18 22:25:45,030 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,SelfDestructingSolverStorable15 [2023-12-18 22:25:45,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:45,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -983657282, now seen corresponding path program 1 times [2023-12-18 22:25:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452206463] [2023-12-18 22:25:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:25:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:25:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:25:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-18 22:25:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452206463] [2023-12-18 22:25:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452206463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:25:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960299587] [2023-12-18 22:25:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:45,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:25:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:25:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:25:45,091 INFO L87 Difference]: Start difference. First operand 50163 states and 68478 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-18 22:25:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:46,776 INFO L93 Difference]: Finished difference Result 95865 states and 128803 transitions. [2023-12-18 22:25:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:25:46,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-18 22:25:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:46,879 INFO L225 Difference]: With dead ends: 95865 [2023-12-18 22:25:46,880 INFO L226 Difference]: Without dead ends: 47845 [2023-12-18 22:25:46,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-18 22:25:46,928 INFO L413 NwaCegarLoop]: 4070 mSDtfsCounter, 287 mSDsluCounter, 11992 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 16062 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:46,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 16062 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 22:25:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47845 states. [2023-12-18 22:25:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47845 to 45155. [2023-12-18 22:25:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45155 states, 38370 states have (on average 1.3295543393275997) internal successors, (51015), 39264 states have internal predecessors, (51015), 3255 states have call successors, (3255), 2473 states have call predecessors, (3255), 3528 states have return successors, (6773), 3449 states have call predecessors, (6773), 3253 states have call successors, (6773) [2023-12-18 22:25:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45155 states to 45155 states and 61043 transitions. [2023-12-18 22:25:48,606 INFO L78 Accepts]: Start accepts. Automaton has 45155 states and 61043 transitions. Word has length 146 [2023-12-18 22:25:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:48,607 INFO L495 AbstractCegarLoop]: Abstraction has 45155 states and 61043 transitions. [2023-12-18 22:25:48,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-18 22:25:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 45155 states and 61043 transitions. [2023-12-18 22:25:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:25:48,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:48,644 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, 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-18 22:25:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-18 22:25:48,645 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:48,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1413843700, now seen corresponding path program 1 times [2023-12-18 22:25:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086661694] [2023-12-18 22:25:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:25:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-18 22:25:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:25:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-18 22:25:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:48,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086661694] [2023-12-18 22:25:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086661694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:25:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447944668] [2023-12-18 22:25:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:48,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:25:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:25:48,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:25:48,702 INFO L87 Difference]: Start difference. First operand 45155 states and 61043 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-18 22:25:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:49,963 INFO L93 Difference]: Finished difference Result 80117 states and 107182 transitions. [2023-12-18 22:25:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:25:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-18 22:25:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:50,049 INFO L225 Difference]: With dead ends: 80117 [2023-12-18 22:25:50,049 INFO L226 Difference]: Without dead ends: 37097 [2023-12-18 22:25:50,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-18 22:25:50,099 INFO L413 NwaCegarLoop]: 4069 mSDtfsCounter, 287 mSDsluCounter, 11991 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 16060 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:50,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 16060 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 22:25:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37097 states. [2023-12-18 22:25:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37097 to 34547. [2023-12-18 22:25:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 29508 states have (on average 1.3484817676562288) internal successors, (39791), 30146 states have internal predecessors, (39791), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2023-12-18 22:25:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 47019 transitions. [2023-12-18 22:25:51,435 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 47019 transitions. Word has length 146 [2023-12-18 22:25:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:51,435 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 47019 transitions. [2023-12-18 22:25:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-18 22:25:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 47019 transitions. [2023-12-18 22:25:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:25:51,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:51,601 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:25:51,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-18 22:25:51,602 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:51,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 884976712, now seen corresponding path program 1 times [2023-12-18 22:25:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749444597] [2023-12-18 22:25:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:25:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:25:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:25:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:25:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-18 22:25:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749444597] [2023-12-18 22:25:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749444597] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295381668] [2023-12-18 22:25:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:51,733 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-18 22:25:51,756 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-18 22:25:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:51,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:51,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-18 22:25:51,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295381668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:51,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861331910] [2023-12-18 22:25:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:51,902 INFO L87 Difference]: Start difference. First operand 34547 states and 47019 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:52,903 INFO L93 Difference]: Finished difference Result 56595 states and 78589 transitions. [2023-12-18 22:25:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 150 [2023-12-18 22:25:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:52,974 INFO L225 Difference]: With dead ends: 56595 [2023-12-18 22:25:52,974 INFO L226 Difference]: Without dead ends: 34635 [2023-12-18 22:25:53,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-18 22:25:53,005 INFO L413 NwaCegarLoop]: 4210 mSDtfsCounter, 134 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8316 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:53,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 8316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2023-12-18 22:25:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 34547. [2023-12-18 22:25:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 29508 states have (on average 1.3250982784329672) internal successors, (39101), 30146 states have internal predecessors, (39101), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2023-12-18 22:25:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 46329 transitions. [2023-12-18 22:25:54,085 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 46329 transitions. Word has length 150 [2023-12-18 22:25:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:54,085 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 46329 transitions. [2023-12-18 22:25:54,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 46329 transitions. [2023-12-18 22:25:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:25:54,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:54,112 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, 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] [2023-12-18 22:25:54,118 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-18 22:25:54,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:54,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:54,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash -743401018, now seen corresponding path program 1 times [2023-12-18 22:25:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685716481] [2023-12-18 22:25:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:25:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:25:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:25:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:25:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-18 22:25:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685716481] [2023-12-18 22:25:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685716481] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486955531] [2023-12-18 22:25:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:54,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:54,425 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-18 22:25:54,429 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-18 22:25:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:54,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:54,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-18 22:25:54,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486955531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873735845] [2023-12-18 22:25:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:54,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:54,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:54,541 INFO L87 Difference]: Start difference. First operand 34547 states and 46329 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-18 22:25:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:55,336 INFO L93 Difference]: Finished difference Result 59540 states and 80626 transitions. [2023-12-18 22:25:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:55,337 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 150 [2023-12-18 22:25:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:55,403 INFO L225 Difference]: With dead ends: 59540 [2023-12-18 22:25:55,403 INFO L226 Difference]: Without dead ends: 29432 [2023-12-18 22:25:55,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-18 22:25:55,453 INFO L413 NwaCegarLoop]: 4122 mSDtfsCounter, 4112 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 4148 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-18 22:25:55,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 4148 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29432 states. [2023-12-18 22:25:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29432 to 28318. [2023-12-18 22:25:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.3000534561454007) internal successors, (31616), 24814 states have internal predecessors, (31616), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-18 22:25:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 37086 transitions. [2023-12-18 22:25:56,354 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 37086 transitions. Word has length 150 [2023-12-18 22:25:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:56,354 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 37086 transitions. [2023-12-18 22:25:56,355 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-18 22:25:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 37086 transitions. [2023-12-18 22:25:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:25:56,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:56,373 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, 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] [2023-12-18 22:25:56,378 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-18 22:25:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:56,574 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:56,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1568094184, now seen corresponding path program 1 times [2023-12-18 22:25:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207689934] [2023-12-18 22:25:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:25:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:25:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-18 22:25:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:25:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-18 22:25:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207689934] [2023-12-18 22:25:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207689934] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091375635] [2023-12-18 22:25:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:56,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:56,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:56,655 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-18 22:25:56,689 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-18 22:25:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:56,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:56,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-18 22:25:56,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091375635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:56,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398493879] [2023-12-18 22:25:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:56,864 INFO L87 Difference]: Start difference. First operand 28318 states and 37086 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:57,859 INFO L93 Difference]: Finished difference Result 46898 states and 62316 transitions. [2023-12-18 22:25:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 150 [2023-12-18 22:25:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:57,928 INFO L225 Difference]: With dead ends: 46898 [2023-12-18 22:25:57,928 INFO L226 Difference]: Without dead ends: 28390 [2023-12-18 22:25:57,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-18 22:25:57,963 INFO L413 NwaCegarLoop]: 4252 mSDtfsCounter, 129 mSDsluCounter, 4105 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 8357 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-18 22:25:57,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 8357 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:25:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28390 states. [2023-12-18 22:25:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28390 to 28318. [2023-12-18 22:25:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.2725029812081088) internal successors, (30946), 24814 states have internal predecessors, (30946), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-18 22:25:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36416 transitions. [2023-12-18 22:25:59,122 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36416 transitions. Word has length 150 [2023-12-18 22:25:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:59,122 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36416 transitions. [2023-12-18 22:25:59,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-18 22:25:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36416 transitions. [2023-12-18 22:25:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-18 22:25:59,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:59,139 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, 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] [2023-12-18 22:25:59,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-18 22:25:59,339 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,SelfDestructingSolverStorable20 [2023-12-18 22:25:59,340 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:59,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1798513045, now seen corresponding path program 1 times [2023-12-18 22:25:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798157269] [2023-12-18 22:25:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:25:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:25:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:25:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:25:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:25:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:25:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:25:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-18 22:25:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-18 22:25:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798157269] [2023-12-18 22:25:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798157269] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695442806] [2023-12-18 22:25:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:59,436 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-18 22:25:59,439 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-18 22:25:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:59,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:59,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-18 22:25:59,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695442806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072701813] [2023-12-18 22:25:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:59,553 INFO L87 Difference]: Start difference. First operand 28318 states and 36416 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-18 22:26:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:00,371 INFO L93 Difference]: Finished difference Result 41138 states and 53439 transitions. [2023-12-18 22:26:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:26:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 151 [2023-12-18 22:26:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:00,435 INFO L225 Difference]: With dead ends: 41138 [2023-12-18 22:26:00,435 INFO L226 Difference]: Without dead ends: 28366 [2023-12-18 22:26:00,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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-18 22:26:00,466 INFO L413 NwaCegarLoop]: 4231 mSDtfsCounter, 147 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8325 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:26:00,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8325 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:26:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28366 states. [2023-12-18 22:26:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28366 to 28318. [2023-12-18 22:26:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.262058472799046) internal successors, (30692), 24814 states have internal predecessors, (30692), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-18 22:26:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36162 transitions. [2023-12-18 22:26:01,465 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36162 transitions. Word has length 151 [2023-12-18 22:26:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:01,465 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36162 transitions. [2023-12-18 22:26:01,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-18 22:26:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36162 transitions. [2023-12-18 22:26:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:26:01,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:01,483 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, 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] [2023-12-18 22:26:01,490 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-18 22:26:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:01,684 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:01,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1582730188, now seen corresponding path program 1 times [2023-12-18 22:26:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880805756] [2023-12-18 22:26:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:26:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:26:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:26:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:26:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-18 22:26:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880805756] [2023-12-18 22:26:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880805756] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:26:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715747071] [2023-12-18 22:26:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:01,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:26:01,882 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-18 22:26:01,883 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-18 22:26:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:01,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 22:26:02,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:26:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-18 22:26:02,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:26:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715747071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:26:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-18 22:26:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752372603] [2023-12-18 22:26:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:26:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:26:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-18 22:26:02,147 INFO L87 Difference]: Start difference. First operand 28318 states and 36162 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:02,951 INFO L93 Difference]: Finished difference Result 38032 states and 48443 transitions. [2023-12-18 22:26:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:26:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-18 22:26:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:02,997 INFO L225 Difference]: With dead ends: 38032 [2023-12-18 22:26:02,997 INFO L226 Difference]: Without dead ends: 20889 [2023-12-18 22:26:03,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-18 22:26:03,027 INFO L413 NwaCegarLoop]: 4060 mSDtfsCounter, 4135 mSDsluCounter, 8070 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 12130 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 22:26:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 12130 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 22:26:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20889 states. [2023-12-18 22:26:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20889 to 20829. [2023-12-18 22:26:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20829 states, 17990 states have (on average 1.2656475819899944) internal successors, (22769), 18318 states have internal predecessors, (22769), 1389 states have call successors, (1389), 1057 states have call predecessors, (1389), 1448 states have return successors, (2451), 1457 states have call predecessors, (2451), 1387 states have call successors, (2451) [2023-12-18 22:26:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20829 states to 20829 states and 26609 transitions. [2023-12-18 22:26:03,792 INFO L78 Accepts]: Start accepts. Automaton has 20829 states and 26609 transitions. Word has length 152 [2023-12-18 22:26:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:03,792 INFO L495 AbstractCegarLoop]: Abstraction has 20829 states and 26609 transitions. [2023-12-18 22:26:03,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20829 states and 26609 transitions. [2023-12-18 22:26:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:26:03,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:03,802 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, 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] [2023-12-18 22:26:03,807 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-18 22:26:04,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:04,003 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:04,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 144414774, now seen corresponding path program 1 times [2023-12-18 22:26:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574849616] [2023-12-18 22:26:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:26:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:26:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:26:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:26:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-18 22:26:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574849616] [2023-12-18 22:26:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574849616] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:26:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329648679] [2023-12-18 22:26:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:04,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:04,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:26:04,081 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-18 22:26:04,110 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-18 22:26:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:04,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:26:04,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:26:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-18 22:26:04,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:26:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329648679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:26:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:26:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948486375] [2023-12-18 22:26:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:26:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:26:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:26:04,187 INFO L87 Difference]: Start difference. First operand 20829 states and 26609 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:04,792 INFO L93 Difference]: Finished difference Result 33378 states and 42274 transitions. [2023-12-18 22:26:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:26:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-18 22:26:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:04,819 INFO L225 Difference]: With dead ends: 33378 [2023-12-18 22:26:04,820 INFO L226 Difference]: Without dead ends: 14679 [2023-12-18 22:26:04,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-18 22:26:04,845 INFO L413 NwaCegarLoop]: 4114 mSDtfsCounter, 20 mSDsluCounter, 8220 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12334 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-18 22:26:04,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12334 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:26:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14679 states. [2023-12-18 22:26:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14679 to 14407. [2023-12-18 22:26:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14407 states, 12459 states have (on average 1.2823661610081065) internal successors, (15977), 12670 states have internal predecessors, (15977), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2023-12-18 22:26:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 18470 transitions. [2023-12-18 22:26:05,371 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 18470 transitions. Word has length 152 [2023-12-18 22:26:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:05,372 INFO L495 AbstractCegarLoop]: Abstraction has 14407 states and 18470 transitions. [2023-12-18 22:26:05,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 18470 transitions. [2023-12-18 22:26:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:26:05,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:05,377 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, 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] [2023-12-18 22:26:05,386 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-18 22:26:05,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-18 22:26:05,578 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:05,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1639614776, now seen corresponding path program 1 times [2023-12-18 22:26:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662977383] [2023-12-18 22:26:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:26:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:26:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:26:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:26:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-18 22:26:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:05,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662977383] [2023-12-18 22:26:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662977383] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:26:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377516235] [2023-12-18 22:26:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:26:05,658 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-18 22:26:05,691 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-18 22:26:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:05,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:26:05,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:26:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-18 22:26:05,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:26:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377516235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:26:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:26:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524774790] [2023-12-18 22:26:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:26:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:26:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:26:05,761 INFO L87 Difference]: Start difference. First operand 14407 states and 18470 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:06,111 INFO L93 Difference]: Finished difference Result 24567 states and 30849 transitions. [2023-12-18 22:26:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:26:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-18 22:26:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:06,148 INFO L225 Difference]: With dead ends: 24567 [2023-12-18 22:26:06,148 INFO L226 Difference]: Without dead ends: 12290 [2023-12-18 22:26:06,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-18 22:26:06,166 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 11 mSDsluCounter, 8220 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12333 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-18 22:26:06,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:26:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2023-12-18 22:26:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 12266. [2023-12-18 22:26:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 10627 states have (on average 1.2867224992942505) internal successors, (13674), 10788 states have internal predecessors, (13674), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2023-12-18 22:26:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 15690 transitions. [2023-12-18 22:26:06,646 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 15690 transitions. Word has length 152 [2023-12-18 22:26:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:06,646 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 15690 transitions. [2023-12-18 22:26:06,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 15690 transitions. [2023-12-18 22:26:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:26:06,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:06,650 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, 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] [2023-12-18 22:26:06,656 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-18 22:26:06,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:06,851 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:06,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -75876666, now seen corresponding path program 1 times [2023-12-18 22:26:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431228401] [2023-12-18 22:26:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:26:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:26:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:26:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:26:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-18 22:26:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431228401] [2023-12-18 22:26:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431228401] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:26:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106607902] [2023-12-18 22:26:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:06,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:26:06,954 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 22:26:06,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-18 22:26:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:26:07,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:26:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-18 22:26:07,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:26:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106607902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:26:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:26:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199156613] [2023-12-18 22:26:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:26:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:26:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:26:07,073 INFO L87 Difference]: Start difference. First operand 12266 states and 15690 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:07,304 INFO L93 Difference]: Finished difference Result 17195 states and 21461 transitions. [2023-12-18 22:26:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:26:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-18 22:26:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:07,312 INFO L225 Difference]: With dead ends: 17195 [2023-12-18 22:26:07,312 INFO L226 Difference]: Without dead ends: 5187 [2023-12-18 22:26:07,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-18 22:26:07,324 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 2 mSDsluCounter, 8221 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12334 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-18 22:26:07,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12334 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:26:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2023-12-18 22:26:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2023-12-18 22:26:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 4691 states have (on average 1.4523555745043701) internal successors, (6813), 4714 states have internal predecessors, (6813), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-18 22:26:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7392 transitions. [2023-12-18 22:26:07,462 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7392 transitions. Word has length 152 [2023-12-18 22:26:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:07,462 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7392 transitions. [2023-12-18 22:26:07,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-18 22:26:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7392 transitions. [2023-12-18 22:26:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-18 22:26:07,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:07,465 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, 1] [2023-12-18 22:26:07,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-18 22:26:07,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:26:07,667 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:07,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -633536807, now seen corresponding path program 1 times [2023-12-18 22:26:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317199839] [2023-12-18 22:26:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-18 22:26:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-18 22:26:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:26:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-18 22:26:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-18 22:26:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:07,792 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-18 22:26:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317199839] [2023-12-18 22:26:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317199839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:26:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:26:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264688159] [2023-12-18 22:26:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:26:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:26:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:26:07,794 INFO L87 Difference]: Start difference. First operand 5187 states and 7392 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-18 22:26:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:08,523 INFO L93 Difference]: Finished difference Result 5405 states and 7617 transitions. [2023-12-18 22:26:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:26:08,523 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), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 184 [2023-12-18 22:26:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:08,532 INFO L225 Difference]: With dead ends: 5405 [2023-12-18 22:26:08,532 INFO L226 Difference]: Without dead ends: 5402 [2023-12-18 22:26:08,534 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-18 22:26:08,534 INFO L413 NwaCegarLoop]: 4152 mSDtfsCounter, 4609 mSDsluCounter, 16304 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4642 SdHoareTripleChecker+Valid, 20456 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:26:08,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4642 Valid, 20456 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-18 22:26:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2023-12-18 22:26:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5186. [2023-12-18 22:26:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 4691 states have (on average 1.4515028778512045) internal successors, (6809), 4713 states have internal predecessors, (6809), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-18 22:26:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7387 transitions. [2023-12-18 22:26:08,686 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7387 transitions. Word has length 184 [2023-12-18 22:26:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:08,686 INFO L495 AbstractCegarLoop]: Abstraction has 5186 states and 7387 transitions. [2023-12-18 22:26:08,687 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), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-18 22:26:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7387 transitions. [2023-12-18 22:26:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-18 22:26:08,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:08,690 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, 1, 1, 1, 1, 1] [2023-12-18 22:26:08,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-18 22:26:08,690 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:08,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1918634495, now seen corresponding path program 1 times [2023-12-18 22:26:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798325118] [2023-12-18 22:26:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:26:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:26:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:26:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:26:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:26:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-18 22:26:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-18 22:26:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:26:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-18 22:26:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:26:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-18 22:26:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:26:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-18 22:26:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:26:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798325118] [2023-12-18 22:26:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798325118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:26:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:26:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:26:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311806024] [2023-12-18 22:26:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:26:08,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:26:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:26:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:26:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:26:08,775 INFO L87 Difference]: Start difference. First operand 5186 states and 7387 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-18 22:26:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:26:09,167 INFO L93 Difference]: Finished difference Result 6694 states and 9047 transitions. [2023-12-18 22:26:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:26:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 188 [2023-12-18 22:26:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:26:09,173 INFO L225 Difference]: With dead ends: 6694 [2023-12-18 22:26:09,174 INFO L226 Difference]: Without dead ends: 5422 [2023-12-18 22:26:09,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:26:09,175 INFO L413 NwaCegarLoop]: 4061 mSDtfsCounter, 133 mSDsluCounter, 12059 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 16120 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 22:26:09,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 16120 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 22:26:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2023-12-18 22:26:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5190. [2023-12-18 22:26:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4695 states have (on average 1.4511182108626197) internal successors, (6813), 4717 states have internal predecessors, (6813), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-18 22:26:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7391 transitions. [2023-12-18 22:26:09,317 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7391 transitions. Word has length 188 [2023-12-18 22:26:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:26:09,317 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7391 transitions. [2023-12-18 22:26:09,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-18 22:26:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7391 transitions. [2023-12-18 22:26:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-18 22:26:09,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:26:09,320 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, 1, 1, 1, 1, 1, 1] [2023-12-18 22:26:09,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-18 22:26:09,320 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:26:09,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:26:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1881060228, now seen corresponding path program 1 times [2023-12-18 22:26:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:26:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561466987] [2023-12-18 22:26:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:26:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:26:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:26:09,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 22:26:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:26:09,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 22:26:09,408 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 22:26:09,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 22:26:09,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 22:26:09,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-18 22:26:09,413 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] [2023-12-18 22:26:09,416 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 22:26:09,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:26:09 BoogieIcfgContainer [2023-12-18 22:26:09,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 22:26:09,526 INFO L158 Benchmark]: Toolchain (without parser) took 67675.63ms. Allocated memory was 311.4MB in the beginning and 6.9GB in the end (delta: 6.6GB). Free memory was 259.0MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-18 22:26:09,526 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 234.9MB. Free memory is still 187.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 22:26:09,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2214.22ms. Allocated memory is still 311.4MB. Free memory was 258.6MB in the beginning and 147.1MB in the end (delta: 111.4MB). Peak memory consumption was 132.4MB. Max. memory is 8.0GB. [2023-12-18 22:26:09,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 472.40ms. Allocated memory was 311.4MB in the beginning and 544.2MB in the end (delta: 232.8MB). Free memory was 146.6MB in the beginning and 397.2MB in the end (delta: -250.6MB). Peak memory consumption was 83.4MB. Max. memory is 8.0GB. [2023-12-18 22:26:09,528 INFO L158 Benchmark]: Boogie Preprocessor took 461.45ms. Allocated memory is still 544.2MB. Free memory was 397.2MB in the beginning and 346.9MB in the end (delta: 50.3MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-18 22:26:09,529 INFO L158 Benchmark]: RCFGBuilder took 6085.52ms. Allocated memory was 544.2MB in the beginning and 1.7GB in the end (delta: 1.1GB). Free memory was 346.9MB in the beginning and 873.2MB in the end (delta: -526.4MB). Peak memory consumption was 613.9MB. Max. memory is 8.0GB. [2023-12-18 22:26:09,530 INFO L158 Benchmark]: TraceAbstraction took 58434.77ms. Allocated memory was 1.7GB in the beginning and 6.9GB in the end (delta: 5.2GB). Free memory was 872.7MB in the beginning and 4.8GB in the end (delta: -3.9GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-18 22:26:09,532 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.40ms. Allocated memory is still 234.9MB. Free memory is still 187.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2214.22ms. Allocated memory is still 311.4MB. Free memory was 258.6MB in the beginning and 147.1MB in the end (delta: 111.4MB). Peak memory consumption was 132.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 472.40ms. Allocated memory was 311.4MB in the beginning and 544.2MB in the end (delta: 232.8MB). Free memory was 146.6MB in the beginning and 397.2MB in the end (delta: -250.6MB). Peak memory consumption was 83.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 461.45ms. Allocated memory is still 544.2MB. Free memory was 397.2MB in the beginning and 346.9MB in the end (delta: 50.3MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * RCFGBuilder took 6085.52ms. Allocated memory was 544.2MB in the beginning and 1.7GB in the end (delta: 1.1GB). Free memory was 346.9MB in the beginning and 873.2MB in the end (delta: -526.4MB). Peak memory consumption was 613.9MB. Max. memory is 8.0GB. * TraceAbstraction took 58434.77ms. Allocated memory was 1.7GB in the beginning and 6.9GB in the end (delta: 5.2GB). Free memory was 872.7MB in the beginning and 4.8GB in the end (delta: -3.9GB). Peak memory consumption was 1.3GB. 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 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE, EXPR \read(tmp_ndt_1) [L11461] EXPR m_st = 1 [L11462] CALL, EXPR master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] COND TRUE 1 [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET, EXPR master() [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 [L11278] token += 1 [L11279] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 [L11314] token += 1 [L11315] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] CALL error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11133]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2249 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 58.3s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69527 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69380 mSDsluCounter, 316424 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200358 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7889 IncrementalHoareTripleChecker+Invalid, 8492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 116066 mSDtfsCounter, 7889 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3304 GetRequests, 3107 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50283occurred in iteration=14, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 21853 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 6329 NumberOfCodeBlocks, 6329 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6094 ConstructedInterpolants, 0 QuantifiedInterpolants, 9640 SizeOfPredicates, 3 NumberOfNonLiveVariables, 9227 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3042/3482 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-18 22:26:09,545 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...