/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_label49+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:33:44,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:33:44,772 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:33:44,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:33:44,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:33:44,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:33:44,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:33:44,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:33:44,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:33:44,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:33:44,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:33:44,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:33:44,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:33:44,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:33:44,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:33:44,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:33:44,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:33:44,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:33:44,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:33:44,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:33:44,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:33:44,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:33:44,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:33:44,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:33:44,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:33:44,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:33:44,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:33:44,885 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:33:45,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:33:45,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:33:45,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:33:45,091 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:33:45,093 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:33:45,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label49+token_ring.02.cil-2.c [2023-12-18 22:33:46,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:33:46,626 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:33:46,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label49+token_ring.02.cil-2.c [2023-12-18 22:33:46,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7a1186f/16b791cf634546fa8dc8d1c39ce94963/FLAGd7f4766f9 [2023-12-18 22:33:46,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7a1186f/16b791cf634546fa8dc8d1c39ce94963 [2023-12-18 22:33:46,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:33:46,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:33:46,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:33:46,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:33:46,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:33:46,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:46" (1/1) ... [2023-12-18 22:33:46,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d517a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:46, skipping insertion in model container [2023-12-18 22:33:46,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:46" (1/1) ... [2023-12-18 22:33:46,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:33:48,071 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_label49+token_ring.02.cil-2.c[380593,380606] [2023-12-18 22:33:48,095 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_label49+token_ring.02.cil-2.c[383339,383352] [2023-12-18 22:33:48,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:33:48,215 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:33:48,808 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_label49+token_ring.02.cil-2.c[380593,380606] [2023-12-18 22:33:48,813 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_label49+token_ring.02.cil-2.c[383339,383352] [2023-12-18 22:33:48,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:33:48,871 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:33:48,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48 WrapperNode [2023-12-18 22:33:48,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:33:48,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:33:48,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:33:48,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:33:48,878 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:33:48" (1/1) ... [2023-12-18 22:33:48,940 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:33:48" (1/1) ... [2023-12-18 22:33:49,205 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12639 [2023-12-18 22:33:49,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:33:49,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:33:49,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:33:49,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:33:49,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,335 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:33:49,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:33:49,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:33:49,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:33:49,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:33:49,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (1/1) ... [2023-12-18 22:33:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:33:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:33:49,818 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:33:49,833 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:33:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:33:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-18 22:33:49,848 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-18 22:33:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-18 22:33:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-18 22:33:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-18 22:33:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-18 22:33:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-18 22:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-18 22:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-18 22:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-18 22:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-18 22:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-18 22:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-18 22:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-18 22:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:33:49,934 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:33:49,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:33:55,398 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:33:55,574 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:33:55,575 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-18 22:33:55,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:55 BoogieIcfgContainer [2023-12-18 22:33:55,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:33:55,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:33:55,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:33:55,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:33:55,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:33:46" (1/3) ... [2023-12-18 22:33:55,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6a36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:55, skipping insertion in model container [2023-12-18 22:33:55,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:48" (2/3) ... [2023-12-18 22:33:55,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6a36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:55, skipping insertion in model container [2023-12-18 22:33:55,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:55" (3/3) ... [2023-12-18 22:33:55,583 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.02.cil-2.c [2023-12-18 22:33:55,597 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:33:55,597 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:33:55,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:33:55,683 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;@183f1416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:33:55,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:33:55,692 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:33:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:33:55,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:33:55,717 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:33:55,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:33:55,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:33:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -555129388, now seen corresponding path program 1 times [2023-12-18 22:33:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:33:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988389581] [2023-12-18 22:33:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:33:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:33:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:55,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:33:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:33:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:33:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:33:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:33:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:56,057 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:33:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:33:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988389581] [2023-12-18 22:33:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988389581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:33:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:33:56,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:33:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985911069] [2023-12-18 22:33:56,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:33:56,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:33:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:33:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:33:56,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:33:56,091 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:33:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:33:56,831 INFO L93 Difference]: Finished difference Result 4665 states and 8728 transitions. [2023-12-18 22:33:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:33:56,833 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:33:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:33:56,849 INFO L225 Difference]: With dead ends: 4665 [2023-12-18 22:33:56,849 INFO L226 Difference]: Without dead ends: 2418 [2023-12-18 22:33:56,856 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:33:56,858 INFO L413 NwaCegarLoop]: 4068 mSDtfsCounter, 4366 mSDsluCounter, 12180 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:33:56,859 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.5s Time] [2023-12-18 22:33:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2023-12-18 22:33:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2357. [2023-12-18 22:33:56,960 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:33:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4317 transitions. [2023-12-18 22:33:56,970 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4317 transitions. Word has length 62 [2023-12-18 22:33:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:33:56,971 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4317 transitions. [2023-12-18 22:33:56,971 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:33:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4317 transitions. [2023-12-18 22:33:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:33:56,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:33:56,978 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:33:56,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 22:33:56,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:33:56,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:33:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1577238292, now seen corresponding path program 1 times [2023-12-18 22:33:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:33:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597597999] [2023-12-18 22:33:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:33:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:33:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:33:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:33:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:33:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:33:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:33:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:57,124 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:33:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:33:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597597999] [2023-12-18 22:33:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597597999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:33:57,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:33:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:33:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566291590] [2023-12-18 22:33:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:33:57,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:33:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:33:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:33:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:33:57,127 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:33:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:33:58,048 INFO L93 Difference]: Finished difference Result 2788 states and 4980 transitions. [2023-12-18 22:33:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:33:58,049 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:33:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:33:58,058 INFO L225 Difference]: With dead ends: 2788 [2023-12-18 22:33:58,058 INFO L226 Difference]: Without dead ends: 2560 [2023-12-18 22:33:58,059 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:33:58,060 INFO L413 NwaCegarLoop]: 4143 mSDtfsCounter, 4356 mSDsluCounter, 16397 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2023-12-18 22:33:58,061 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.6s Time] [2023-12-18 22:33:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-12-18 22:33:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2463. [2023-12-18 22:33:58,117 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:33:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4475 transitions. [2023-12-18 22:33:58,131 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4475 transitions. Word has length 62 [2023-12-18 22:33:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:33:58,131 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 4475 transitions. [2023-12-18 22:33:58,131 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:33:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4475 transitions. [2023-12-18 22:33:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:33:58,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:33:58,133 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:33:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 22:33:58,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:33:58,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:33:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1096158034, now seen corresponding path program 1 times [2023-12-18 22:33:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:33:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429737003] [2023-12-18 22:33:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:33:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:33:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:33:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:33:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:33:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:33:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:33:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:58,296 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:33:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:33:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429737003] [2023-12-18 22:33:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429737003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:33:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:33:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:33:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454769948] [2023-12-18 22:33:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:33:58,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:33:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:33:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:33:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:33:58,298 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:33:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:33:59,040 INFO L93 Difference]: Finished difference Result 3161 states and 5546 transitions. [2023-12-18 22:33:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:33:59,040 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:33:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:33:59,050 INFO L225 Difference]: With dead ends: 3161 [2023-12-18 22:33:59,050 INFO L226 Difference]: Without dead ends: 2827 [2023-12-18 22:33:59,051 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:33:59,052 INFO L413 NwaCegarLoop]: 4073 mSDtfsCounter, 4394 mSDsluCounter, 16214 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:33:59,053 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.5s Time] [2023-12-18 22:33:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2023-12-18 22:33:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2676. [2023-12-18 22:33:59,106 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:33:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4796 transitions. [2023-12-18 22:33:59,114 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4796 transitions. Word has length 62 [2023-12-18 22:33:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:33:59,114 INFO L495 AbstractCegarLoop]: Abstraction has 2676 states and 4796 transitions. [2023-12-18 22:33:59,114 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:33:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4796 transitions. [2023-12-18 22:33:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:33:59,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:33:59,115 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:33:59,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 22:33:59,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:33:59,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:33:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1080639316, now seen corresponding path program 1 times [2023-12-18 22:33:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:33:59,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158015234] [2023-12-18 22:33:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:33:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:33:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:33:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:33:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:33:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:33:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:33:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:33:59,220 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:33:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:33:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158015234] [2023-12-18 22:33:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158015234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:33:59,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:33:59,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:33:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269320227] [2023-12-18 22:33:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:33:59,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:33:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:33:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:33:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:33:59,222 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:34:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:00,078 INFO L93 Difference]: Finished difference Result 3963 states and 6765 transitions. [2023-12-18 22:34:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:34:00,079 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:34:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:00,090 INFO L225 Difference]: With dead ends: 3963 [2023-12-18 22:34:00,091 INFO L226 Difference]: Without dead ends: 3416 [2023-12-18 22:34:00,093 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:34:00,094 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:34:00,094 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:34:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-12-18 22:34:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3060. [2023-12-18 22:34:00,158 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:34:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 5370 transitions. [2023-12-18 22:34:00,168 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 5370 transitions. Word has length 62 [2023-12-18 22:34:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:00,169 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 5370 transitions. [2023-12-18 22:34:00,169 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:34:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 5370 transitions. [2023-12-18 22:34:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:34:00,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:00,170 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:34:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-18 22:34:00,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:00,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 727550934, now seen corresponding path program 1 times [2023-12-18 22:34:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372146888] [2023-12-18 22:34:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:00,247 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:34:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372146888] [2023-12-18 22:34:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372146888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:00,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:34:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260208554] [2023-12-18 22:34:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:00,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:34:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:34:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:00,249 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:34:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:01,098 INFO L93 Difference]: Finished difference Result 5261 states and 8705 transitions. [2023-12-18 22:34:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:34:01,098 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:34:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:01,118 INFO L225 Difference]: With dead ends: 5261 [2023-12-18 22:34:01,118 INFO L226 Difference]: Without dead ends: 4330 [2023-12-18 22:34:01,121 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:34:01,122 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.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:34:01,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4376 Valid, 20531 Invalid, 1018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-18 22:34:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2023-12-18 22:34:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3865. [2023-12-18 22:34:01,234 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:34:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 6602 transitions. [2023-12-18 22:34:01,252 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 6602 transitions. Word has length 62 [2023-12-18 22:34:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:01,253 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 6602 transitions. [2023-12-18 22:34:01,253 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:34:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 6602 transitions. [2023-12-18 22:34:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-18 22:34:01,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:01,255 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:34:01,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 22:34:01,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:01,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1639143660, now seen corresponding path program 1 times [2023-12-18 22:34:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079054942] [2023-12-18 22:34:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:01,326 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:34:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079054942] [2023-12-18 22:34:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079054942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:34:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526219614] [2023-12-18 22:34:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:01,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:34:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:01,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:34:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:34:01,329 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:34:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:02,026 INFO L93 Difference]: Finished difference Result 7007 states and 11395 transitions. [2023-12-18 22:34:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:34:02,026 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:34:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:02,045 INFO L225 Difference]: With dead ends: 7007 [2023-12-18 22:34:02,046 INFO L226 Difference]: Without dead ends: 5272 [2023-12-18 22:34:02,053 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:34:02,056 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:34:02,056 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:34:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2023-12-18 22:34:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4737. [2023-12-18 22:34:02,186 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:34:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 7856 transitions. [2023-12-18 22:34:02,197 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 7856 transitions. Word has length 62 [2023-12-18 22:34:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:02,198 INFO L495 AbstractCegarLoop]: Abstraction has 4737 states and 7856 transitions. [2023-12-18 22:34:02,198 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:34:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 7856 transitions. [2023-12-18 22:34:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-18 22:34:02,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:02,206 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:34:02,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-18 22:34:02,206 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:02,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1247054245, now seen corresponding path program 1 times [2023-12-18 22:34:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492203766] [2023-12-18 22:34:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-18 22:34:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,311 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:34:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492203766] [2023-12-18 22:34:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492203766] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008257278] [2023-12-18 22:34:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:02,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:02,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:02,314 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:34:02,323 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:34:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:02,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:02,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:02,471 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:34:02,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008257278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:02,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-18 22:34:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3569122] [2023-12-18 22:34:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:02,473 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:34:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:02,675 INFO L93 Difference]: Finished difference Result 9834 states and 15520 transitions. [2023-12-18 22:34:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:02,676 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:34:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:02,697 INFO L225 Difference]: With dead ends: 9834 [2023-12-18 22:34:02,697 INFO L226 Difference]: Without dead ends: 7227 [2023-12-18 22:34:02,704 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:34:02,704 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:34:02,705 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:34:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2023-12-18 22:34:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7197. [2023-12-18 22:34:02,884 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:34:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 11473 transitions. [2023-12-18 22:34:02,900 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 11473 transitions. Word has length 100 [2023-12-18 22:34:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:02,901 INFO L495 AbstractCegarLoop]: Abstraction has 7197 states and 11473 transitions. [2023-12-18 22:34:02,902 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:34:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 11473 transitions. [2023-12-18 22:34:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-18 22:34:02,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:02,911 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:34:02,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-18 22:34:03,117 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:34:03,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:03,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash -417864389, now seen corresponding path program 1 times [2023-12-18 22:34:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7951097] [2023-12-18 22:34:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-18 22:34:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,201 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:34:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:03,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7951097] [2023-12-18 22:34:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7951097] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065687277] [2023-12-18 22:34:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:03,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:03,203 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:34:03,208 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:34:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:03,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:03,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:03,307 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:34:03,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065687277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:03,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078647740] [2023-12-18 22:34:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:03,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:03,310 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:34:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:03,574 INFO L93 Difference]: Finished difference Result 16951 states and 26175 transitions. [2023-12-18 22:34:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:03,574 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:34:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:03,624 INFO L225 Difference]: With dead ends: 16951 [2023-12-18 22:34:03,624 INFO L226 Difference]: Without dead ends: 11885 [2023-12-18 22:34:03,641 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:34:03,642 INFO L413 NwaCegarLoop]: 4267 mSDtfsCounter, 145 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:34:03,642 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.0s Time] [2023-12-18 22:34:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2023-12-18 22:34:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 11885. [2023-12-18 22:34:04,112 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:34:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 18432 transitions. [2023-12-18 22:34:04,149 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 18432 transitions. Word has length 100 [2023-12-18 22:34:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:04,149 INFO L495 AbstractCegarLoop]: Abstraction has 11885 states and 18432 transitions. [2023-12-18 22:34:04,149 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:34:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 18432 transitions. [2023-12-18 22:34:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-18 22:34:04,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:04,172 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:34:04,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-18 22:34:04,378 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:34:04,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:04,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -151168284, now seen corresponding path program 1 times [2023-12-18 22:34:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644986609] [2023-12-18 22:34:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-18 22:34:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-18 22:34:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,472 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:34:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644986609] [2023-12-18 22:34:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644986609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760963879] [2023-12-18 22:34:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:04,474 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:34:04,500 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:34:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:04,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:04,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:04,666 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:34:04,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760963879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:04,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:04,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-18 22:34:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487107996] [2023-12-18 22:34:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:04,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:04,668 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:34:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:05,282 INFO L93 Difference]: Finished difference Result 31009 states and 47101 transitions. [2023-12-18 22:34:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:05,283 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:34:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:05,349 INFO L225 Difference]: With dead ends: 31009 [2023-12-18 22:34:05,349 INFO L226 Difference]: Without dead ends: 21259 [2023-12-18 22:34:05,375 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:34:05,375 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:34:05,376 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:34:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2023-12-18 22:34:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21151. [2023-12-18 22:34:05,955 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:34:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21151 states to 21151 states and 31956 transitions. [2023-12-18 22:34:06,023 INFO L78 Accepts]: Start accepts. Automaton has 21151 states and 31956 transitions. Word has length 128 [2023-12-18 22:34:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:06,023 INFO L495 AbstractCegarLoop]: Abstraction has 21151 states and 31956 transitions. [2023-12-18 22:34:06,023 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:34:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 21151 states and 31956 transitions. [2023-12-18 22:34:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-18 22:34:06,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:06,070 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:34:06,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-18 22:34:06,275 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:34:06,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:06,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash -206089371, now seen corresponding path program 1 times [2023-12-18 22:34:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727610507] [2023-12-18 22:34:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-18 22:34:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-18 22:34:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-18 22:34:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-18 22:34:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,398 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:34:06,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:06,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727610507] [2023-12-18 22:34:06,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727610507] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:06,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74988331] [2023-12-18 22:34:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:06,400 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:34:06,431 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:34:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:06,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:06,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:06,572 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:34:06,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74988331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938944526] [2023-12-18 22:34:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:06,573 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:34:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:07,148 INFO L93 Difference]: Finished difference Result 42211 states and 63898 transitions. [2023-12-18 22:34:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:07,149 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:34:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:07,237 INFO L225 Difference]: With dead ends: 42211 [2023-12-18 22:34:07,237 INFO L226 Difference]: Without dead ends: 23193 [2023-12-18 22:34:07,279 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:34:07,280 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:34:07,281 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:34:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23193 states. [2023-12-18 22:34:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23193 to 23193. [2023-12-18 22:34:07,890 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:34:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23193 states to 23193 states and 33732 transitions. [2023-12-18 22:34:07,958 INFO L78 Accepts]: Start accepts. Automaton has 23193 states and 33732 transitions. Word has length 144 [2023-12-18 22:34:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:07,958 INFO L495 AbstractCegarLoop]: Abstraction has 23193 states and 33732 transitions. [2023-12-18 22:34:07,959 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:34:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 23193 states and 33732 transitions. [2023-12-18 22:34:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-18 22:34:08,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:08,020 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:34:08,027 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:34:08,227 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:34:08,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:08,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1716162746, now seen corresponding path program 1 times [2023-12-18 22:34:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001477706] [2023-12-18 22:34:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-18 22:34:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-18 22:34:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-18 22:34:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-18 22:34:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,380 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:34:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001477706] [2023-12-18 22:34:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001477706] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683564769] [2023-12-18 22:34:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:08,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:08,382 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:34:08,408 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:34:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:08,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:08,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:08,516 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:34:08,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683564769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068693168] [2023-12-18 22:34:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:08,519 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:34:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:09,028 INFO L93 Difference]: Finished difference Result 39048 states and 56092 transitions. [2023-12-18 22:34:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:09,029 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:34:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:09,105 INFO L225 Difference]: With dead ends: 39048 [2023-12-18 22:34:09,105 INFO L226 Difference]: Without dead ends: 24517 [2023-12-18 22:34:09,138 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:34:09,139 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:34:09,139 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:34:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2023-12-18 22:34:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 24377. [2023-12-18 22:34:09,925 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:34:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24377 states to 24377 states and 34916 transitions. [2023-12-18 22:34:09,975 INFO L78 Accepts]: Start accepts. Automaton has 24377 states and 34916 transitions. Word has length 144 [2023-12-18 22:34:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:09,975 INFO L495 AbstractCegarLoop]: Abstraction has 24377 states and 34916 transitions. [2023-12-18 22:34:09,975 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:34:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24377 states and 34916 transitions. [2023-12-18 22:34:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:34:10,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:10,011 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:34:10,017 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:34:10,217 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:34:10,217 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:10,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash -390630576, now seen corresponding path program 1 times [2023-12-18 22:34:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630086361] [2023-12-18 22:34:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:34:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-18 22:34:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:34:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,318 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:34:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630086361] [2023-12-18 22:34:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630086361] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389960774] [2023-12-18 22:34:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:10,319 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:34:10,352 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:34:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:10,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:10,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:10,447 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:34:10,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389960774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:10,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:10,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147220814] [2023-12-18 22:34:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:10,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:10,450 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:34:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:11,581 INFO L93 Difference]: Finished difference Result 67691 states and 96134 transitions. [2023-12-18 22:34:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:11,581 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:34:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:11,716 INFO L225 Difference]: With dead ends: 67691 [2023-12-18 22:34:11,716 INFO L226 Difference]: Without dead ends: 45451 [2023-12-18 22:34:11,755 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:34:11,756 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:34:11,756 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:34:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45451 states. [2023-12-18 22:34:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45451 to 45407. [2023-12-18 22:34:13,142 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:34:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45407 states to 45407 states and 64568 transitions. [2023-12-18 22:34:13,249 INFO L78 Accepts]: Start accepts. Automaton has 45407 states and 64568 transitions. Word has length 145 [2023-12-18 22:34:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:13,251 INFO L495 AbstractCegarLoop]: Abstraction has 45407 states and 64568 transitions. [2023-12-18 22:34:13,251 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:34:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 45407 states and 64568 transitions. [2023-12-18 22:34:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:34:13,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:13,317 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:34:13,324 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:34:13,524 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:34:13,524 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:13,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1150940390, now seen corresponding path program 1 times [2023-12-18 22:34:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099263481] [2023-12-18 22:34:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:34:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:34:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:34:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,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:34:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099263481] [2023-12-18 22:34:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099263481] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230956250] [2023-12-18 22:34:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:13,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:13,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:13,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:34:13,660 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:34:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:13,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:13,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:13,788 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:34:13,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230956250] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:13,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819457567] [2023-12-18 22:34:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:13,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:13,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:34:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:14,984 INFO L93 Difference]: Finished difference Result 73407 states and 105859 transitions. [2023-12-18 22:34:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:14,985 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:34:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:15,084 INFO L225 Difference]: With dead ends: 73407 [2023-12-18 22:34:15,085 INFO L226 Difference]: Without dead ends: 38659 [2023-12-18 22:34:15,128 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:34:15,129 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:34:15,129 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:34:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38659 states. [2023-12-18 22:34:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38659 to 28179. [2023-12-18 22:34:15,986 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:34:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 38996 transitions. [2023-12-18 22:34:16,167 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 38996 transitions. Word has length 145 [2023-12-18 22:34:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:16,167 INFO L495 AbstractCegarLoop]: Abstraction has 28179 states and 38996 transitions. [2023-12-18 22:34:16,167 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:34:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 38996 transitions. [2023-12-18 22:34:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-18 22:34:16,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:16,201 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:34:16,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-18 22:34:16,407 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:34:16,407 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:16,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -395199399, now seen corresponding path program 1 times [2023-12-18 22:34:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:16,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202746091] [2023-12-18 22:34:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-18 22:34:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-18 22:34:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:34:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-18 22:34:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,514 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:34:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202746091] [2023-12-18 22:34:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202746091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149992930] [2023-12-18 22:34:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:16,516 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:34:16,540 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:34:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:16,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:16,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:16,646 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:34:16,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149992930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883179505] [2023-12-18 22:34:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:16,648 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:34:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:18,036 INFO L93 Difference]: Finished difference Result 76319 states and 105000 transitions. [2023-12-18 22:34:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:18,037 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:34:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:18,189 INFO L225 Difference]: With dead ends: 76319 [2023-12-18 22:34:18,190 INFO L226 Difference]: Without dead ends: 50287 [2023-12-18 22:34:18,238 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:34:18,238 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:34:18,238 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:34:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50287 states. [2023-12-18 22:34:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50287 to 50283. [2023-12-18 22:34:19,937 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:34:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 69318 transitions. [2023-12-18 22:34:20,061 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 69318 transitions. Word has length 145 [2023-12-18 22:34:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 69318 transitions. [2023-12-18 22:34:20,062 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:34:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 69318 transitions. [2023-12-18 22:34:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:34:20,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:20,118 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:34:20,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-18 22:34:20,323 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:34:20,323 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 758009759, now seen corresponding path program 1 times [2023-12-18 22:34:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162364435] [2023-12-18 22:34:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:34:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:34:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:34:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:34:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,399 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:34:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162364435] [2023-12-18 22:34:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162364435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184287935] [2023-12-18 22:34:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:20,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:20,415 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:34:20,441 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:34:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:20,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:20,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:20,533 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:34:20,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:20,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184287935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:20,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:20,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566500847] [2023-12-18 22:34:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:20,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:20,536 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:34:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:22,310 INFO L93 Difference]: Finished difference Result 88239 states and 121052 transitions. [2023-12-18 22:34:22,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:22,310 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:34:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:22,428 INFO L225 Difference]: With dead ends: 88239 [2023-12-18 22:34:22,428 INFO L226 Difference]: Without dead ends: 51007 [2023-12-18 22:34:22,472 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:34:22,473 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:34:22,473 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:34:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51007 states. [2023-12-18 22:34:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51007 to 50283. [2023-12-18 22:34:24,016 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:34:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 68958 transitions. [2023-12-18 22:34:24,135 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 68958 transitions. Word has length 146 [2023-12-18 22:34:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:24,135 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 68958 transitions. [2023-12-18 22:34:24,136 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:34:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 68958 transitions. [2023-12-18 22:34:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:34:24,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:24,184 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:34:24,189 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:34:24,384 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:34:24,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:24,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -35417814, now seen corresponding path program 1 times [2023-12-18 22:34:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351159241] [2023-12-18 22:34:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:34:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:34:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-18 22:34:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:34:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,460 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:34:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351159241] [2023-12-18 22:34:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351159241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100198883] [2023-12-18 22:34:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:24,461 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:34:24,488 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:34:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:24,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:24,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:24,601 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:34:24,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100198883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:24,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250083863] [2023-12-18 22:34:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:24,603 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:34:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:26,353 INFO L93 Difference]: Finished difference Result 87915 states and 120128 transitions. [2023-12-18 22:34:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:26,354 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:34:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:26,507 INFO L225 Difference]: With dead ends: 87915 [2023-12-18 22:34:26,507 INFO L226 Difference]: Without dead ends: 51455 [2023-12-18 22:34:26,558 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:34:26,559 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:34:26,560 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:34:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51455 states. [2023-12-18 22:34:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51455 to 50163. [2023-12-18 22:34:28,266 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:34:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50163 states to 50163 states and 68478 transitions. [2023-12-18 22:34:28,376 INFO L78 Accepts]: Start accepts. Automaton has 50163 states and 68478 transitions. Word has length 146 [2023-12-18 22:34:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 50163 states and 68478 transitions. [2023-12-18 22:34:28,376 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:34:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50163 states and 68478 transitions. [2023-12-18 22:34:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:34:28,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:28,423 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:34:28,428 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:34:28,626 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:34:28,627 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:28,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -322067809, now seen corresponding path program 1 times [2023-12-18 22:34:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230923937] [2023-12-18 22:34:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:34:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:34:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-18 22:34:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:34:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:28,683 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:34:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230923937] [2023-12-18 22:34:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230923937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:28,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:34:28,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692996393] [2023-12-18 22:34:28,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:28,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:34:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:34:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:34:28,684 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:34:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:30,478 INFO L93 Difference]: Finished difference Result 95865 states and 128803 transitions. [2023-12-18 22:34:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:34:30,479 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:34:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:30,583 INFO L225 Difference]: With dead ends: 95865 [2023-12-18 22:34:30,583 INFO L226 Difference]: Without dead ends: 47845 [2023-12-18 22:34:30,631 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:34:30,631 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:34:30,631 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:34:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47845 states. [2023-12-18 22:34:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47845 to 45155. [2023-12-18 22:34:32,072 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:34:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45155 states to 45155 states and 61043 transitions. [2023-12-18 22:34:32,164 INFO L78 Accepts]: Start accepts. Automaton has 45155 states and 61043 transitions. Word has length 146 [2023-12-18 22:34:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:32,164 INFO L495 AbstractCegarLoop]: Abstraction has 45155 states and 61043 transitions. [2023-12-18 22:34:32,165 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:34:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 45155 states and 61043 transitions. [2023-12-18 22:34:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-18 22:34:32,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:32,198 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:34:32,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-18 22:34:32,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:32,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1183406060, now seen corresponding path program 1 times [2023-12-18 22:34:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349982467] [2023-12-18 22:34:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:34:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-18 22:34:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-18 22:34:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-18 22:34:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:32,258 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:34:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349982467] [2023-12-18 22:34:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349982467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:34:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493697727] [2023-12-18 22:34:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:32,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:34:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:34:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:34:32,260 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:34:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:33,693 INFO L93 Difference]: Finished difference Result 80117 states and 107182 transitions. [2023-12-18 22:34:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:34:33,693 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:34:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:33,774 INFO L225 Difference]: With dead ends: 80117 [2023-12-18 22:34:33,774 INFO L226 Difference]: Without dead ends: 37097 [2023-12-18 22:34:33,822 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:34:33,823 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:34:33,823 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:34:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37097 states. [2023-12-18 22:34:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37097 to 34547. [2023-12-18 22:34:34,998 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:34:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 47019 transitions. [2023-12-18 22:34:35,072 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 47019 transitions. Word has length 146 [2023-12-18 22:34:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:35,072 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 47019 transitions. [2023-12-18 22:34:35,072 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:34:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 47019 transitions. [2023-12-18 22:34:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:34:35,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:35,098 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:34:35,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-18 22:34:35,098 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:35,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -800923223, now seen corresponding path program 1 times [2023-12-18 22:34:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330496226] [2023-12-18 22:34:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:34:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:34:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,167 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:34:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330496226] [2023-12-18 22:34:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330496226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866254077] [2023-12-18 22:34:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:35,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:35,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:35,169 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:34:35,172 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:34:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:35,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:35,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:35,286 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:34:35,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866254077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:35,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137674792] [2023-12-18 22:34:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:35,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:35,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:35,290 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:34:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:36,369 INFO L93 Difference]: Finished difference Result 56595 states and 78589 transitions. [2023-12-18 22:34:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:36,369 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:34:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:36,436 INFO L225 Difference]: With dead ends: 56595 [2023-12-18 22:34:36,436 INFO L226 Difference]: Without dead ends: 34635 [2023-12-18 22:34:36,466 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:34:36,467 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:34:36,467 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:34:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2023-12-18 22:34:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 34547. [2023-12-18 22:34:37,609 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:34:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 46329 transitions. [2023-12-18 22:34:37,690 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 46329 transitions. Word has length 150 [2023-12-18 22:34:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:37,690 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 46329 transitions. [2023-12-18 22:34:37,690 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:34:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 46329 transitions. [2023-12-18 22:34:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:34:37,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:37,718 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:34:37,727 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:34:37,918 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:34:37,919 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:37,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1865666343, now seen corresponding path program 1 times [2023-12-18 22:34:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475124532] [2023-12-18 22:34:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:37,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:34:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:34:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,048 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:34:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475124532] [2023-12-18 22:34:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475124532] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:38,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141090116] [2023-12-18 22:34:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:38,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:38,050 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:34:38,076 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:34:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:38,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:34:38,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:38,180 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:34:38,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141090116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419160189] [2023-12-18 22:34:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:38,182 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:34:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:39,089 INFO L93 Difference]: Finished difference Result 59540 states and 80626 transitions. [2023-12-18 22:34:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:39,089 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:34:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:39,158 INFO L225 Difference]: With dead ends: 59540 [2023-12-18 22:34:39,159 INFO L226 Difference]: Without dead ends: 29432 [2023-12-18 22:34:39,201 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:34:39,203 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:34:39,203 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:34:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29432 states. [2023-12-18 22:34:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29432 to 28318. [2023-12-18 22:34:40,170 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:34:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 37086 transitions. [2023-12-18 22:34:40,223 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 37086 transitions. Word has length 150 [2023-12-18 22:34:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 37086 transitions. [2023-12-18 22:34:40,223 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:34:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 37086 transitions. [2023-12-18 22:34:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-18 22:34:40,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:40,368 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:34:40,373 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:34:40,568 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:34:40,569 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:40,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1817854536, now seen corresponding path program 1 times [2023-12-18 22:34:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243224107] [2023-12-18 22:34:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-18 22:34:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-18 22:34:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,646 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:34:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243224107] [2023-12-18 22:34:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243224107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898438030] [2023-12-18 22:34:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:40,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:40,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:40,648 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:34:40,674 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:34:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:40,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:40,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:40,773 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:34:40,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898438030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472193592] [2023-12-18 22:34:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:40,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:40,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:40,774 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:34:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:41,505 INFO L93 Difference]: Finished difference Result 46898 states and 62316 transitions. [2023-12-18 22:34:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:41,505 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:34:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:41,569 INFO L225 Difference]: With dead ends: 46898 [2023-12-18 22:34:41,569 INFO L226 Difference]: Without dead ends: 28390 [2023-12-18 22:34:41,605 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:34:41,606 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:34:41,606 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:34:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28390 states. [2023-12-18 22:34:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28390 to 28318. [2023-12-18 22:34:42,575 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:34:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36416 transitions. [2023-12-18 22:34:42,744 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36416 transitions. Word has length 150 [2023-12-18 22:34:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:42,745 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36416 transitions. [2023-12-18 22:34:42,745 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:34:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36416 transitions. [2023-12-18 22:34:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-18 22:34:42,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:42,761 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:34:42,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-18 22:34:42,961 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:34:42,961 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:42,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1773163818, now seen corresponding path program 1 times [2023-12-18 22:34:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92268378] [2023-12-18 22:34:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:34:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-18 22:34:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,047 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:34:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92268378] [2023-12-18 22:34:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92268378] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758414406] [2023-12-18 22:34:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:43,049 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:34:43,052 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:34:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:43,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:34:43,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:43,155 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:34:43,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:43,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758414406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:34:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881014501] [2023-12-18 22:34:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:43,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:34:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:34:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:43,157 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:34:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:43,955 INFO L93 Difference]: Finished difference Result 41138 states and 53439 transitions. [2023-12-18 22:34:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:34:43,956 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:34:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:44,005 INFO L225 Difference]: With dead ends: 41138 [2023-12-18 22:34:44,005 INFO L226 Difference]: Without dead ends: 28366 [2023-12-18 22:34:44,020 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:34:44,021 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:34:44,021 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:34:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28366 states. [2023-12-18 22:34:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28366 to 28318. [2023-12-18 22:34:44,940 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:34:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36162 transitions. [2023-12-18 22:34:44,986 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36162 transitions. Word has length 151 [2023-12-18 22:34:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:44,986 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36162 transitions. [2023-12-18 22:34:44,986 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:34:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36162 transitions. [2023-12-18 22:34:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:34:45,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:45,003 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:34:45,010 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:34:45,203 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:34:45,203 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:45,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1765070165, now seen corresponding path program 1 times [2023-12-18 22:34:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202764306] [2023-12-18 22:34:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:34:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:34:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,298 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:34:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202764306] [2023-12-18 22:34:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202764306] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541481641] [2023-12-18 22:34:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:45,299 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:34:45,301 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:34:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:45,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 22:34:45,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:45,455 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:34:45,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:45,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541481641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:45,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:45,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-18 22:34:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3593133] [2023-12-18 22:34:45,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:45,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:34:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:34:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-18 22:34:45,456 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:34:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:46,157 INFO L93 Difference]: Finished difference Result 38032 states and 48443 transitions. [2023-12-18 22:34:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:34:46,157 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:34:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:46,199 INFO L225 Difference]: With dead ends: 38032 [2023-12-18 22:34:46,200 INFO L226 Difference]: Without dead ends: 20889 [2023-12-18 22:34:46,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-18 22:34:46,229 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:34:46,229 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:34:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20889 states. [2023-12-18 22:34:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20889 to 20829. [2023-12-18 22:34:46,994 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:34:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20829 states to 20829 states and 26609 transitions. [2023-12-18 22:34:47,031 INFO L78 Accepts]: Start accepts. Automaton has 20829 states and 26609 transitions. Word has length 152 [2023-12-18 22:34:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 20829 states and 26609 transitions. [2023-12-18 22:34:47,031 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:34:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 20829 states and 26609 transitions. [2023-12-18 22:34:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:34:47,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:47,041 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:34:47,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-18 22:34:47,245 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:34:47,246 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:47,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -802752169, now seen corresponding path program 1 times [2023-12-18 22:34:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16938340] [2023-12-18 22:34:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-18 22:34:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:34:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,342 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:34:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16938340] [2023-12-18 22:34:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16938340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922394739] [2023-12-18 22:34:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:47,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:47,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:47,344 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:34:47,347 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:34:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:47,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:34:47,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:47,453 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:34:47,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922394739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:34:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420872692] [2023-12-18 22:34:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:34:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:34:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:34:47,454 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:34:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:48,052 INFO L93 Difference]: Finished difference Result 33378 states and 42274 transitions. [2023-12-18 22:34:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:34:48,053 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:34:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:48,078 INFO L225 Difference]: With dead ends: 33378 [2023-12-18 22:34:48,079 INFO L226 Difference]: Without dead ends: 14679 [2023-12-18 22:34:48,097 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:34:48,097 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:34:48,097 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:34:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14679 states. [2023-12-18 22:34:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14679 to 14407. [2023-12-18 22:34:48,498 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:34:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 18470 transitions. [2023-12-18 22:34:48,520 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 18470 transitions. Word has length 152 [2023-12-18 22:34:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:48,520 INFO L495 AbstractCegarLoop]: Abstraction has 14407 states and 18470 transitions. [2023-12-18 22:34:48,520 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:34:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 18470 transitions. [2023-12-18 22:34:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:34:48,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:48,525 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:34:48,531 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:34:48,725 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:34:48,726 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:48,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1584112330, now seen corresponding path program 1 times [2023-12-18 22:34:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973143598] [2023-12-18 22:34:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:34:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:34:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,811 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:34:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973143598] [2023-12-18 22:34:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973143598] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517354037] [2023-12-18 22:34:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:48,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:48,813 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:34:48,816 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:34:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:48,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:34:48,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:48,914 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:34:48,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517354037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:34:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983486762] [2023-12-18 22:34:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:34:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:34:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:34:48,916 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:34:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:49,262 INFO L93 Difference]: Finished difference Result 24567 states and 30849 transitions. [2023-12-18 22:34:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:34:49,262 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:34:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:49,282 INFO L225 Difference]: With dead ends: 24567 [2023-12-18 22:34:49,282 INFO L226 Difference]: Without dead ends: 12290 [2023-12-18 22:34:49,300 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:34:49,300 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:34:49,300 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:34:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2023-12-18 22:34:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 12266. [2023-12-18 22:34:49,722 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:34:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 15690 transitions. [2023-12-18 22:34:49,740 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 15690 transitions. Word has length 152 [2023-12-18 22:34:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:49,740 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 15690 transitions. [2023-12-18 22:34:49,741 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:34:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 15690 transitions. [2023-12-18 22:34:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-18 22:34:49,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:49,745 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:34:49,751 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:34:49,945 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:34:49,945 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:49,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1147116856, now seen corresponding path program 1 times [2023-12-18 22:34:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143992757] [2023-12-18 22:34:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-18 22:34:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-18 22:34:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:34:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-18 22:34:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,012 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:34:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143992757] [2023-12-18 22:34:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143992757] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:34:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536523272] [2023-12-18 22:34:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:50,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:34:50,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:34:50,013 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:34:50,023 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:34:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:34:50,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:34:50,112 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:34:50,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:34:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536523272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:34:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:34:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37863753] [2023-12-18 22:34:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:50,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:34:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:34:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:34:50,114 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:34:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:50,331 INFO L93 Difference]: Finished difference Result 17195 states and 21461 transitions. [2023-12-18 22:34:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:34:50,332 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:34:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:50,340 INFO L225 Difference]: With dead ends: 17195 [2023-12-18 22:34:50,340 INFO L226 Difference]: Without dead ends: 5187 [2023-12-18 22:34:50,352 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:34:50,352 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:34:50,353 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:34:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2023-12-18 22:34:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2023-12-18 22:34:50,481 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:34:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7392 transitions. [2023-12-18 22:34:50,488 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7392 transitions. Word has length 152 [2023-12-18 22:34:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:50,488 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7392 transitions. [2023-12-18 22:34:50,488 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:34:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7392 transitions. [2023-12-18 22:34:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-18 22:34:50,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:50,490 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:34:50,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-18 22:34:50,691 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:34:50,692 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:50,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -946721479, now seen corresponding path program 1 times [2023-12-18 22:34:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766294899] [2023-12-18 22:34:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-18 22:34:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-18 22:34:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:34:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-18 22:34:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-18 22:34:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:50,816 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:34:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:50,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766294899] [2023-12-18 22:34:50,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766294899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:50,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:34:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115833038] [2023-12-18 22:34:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:50,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:34:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:50,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:34:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:34:50,817 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:34:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:51,597 INFO L93 Difference]: Finished difference Result 5405 states and 7617 transitions. [2023-12-18 22:34:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:34:51,597 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:34:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:51,606 INFO L225 Difference]: With dead ends: 5405 [2023-12-18 22:34:51,606 INFO L226 Difference]: Without dead ends: 5402 [2023-12-18 22:34:51,607 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:34:51,607 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:34:51,608 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:34:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2023-12-18 22:34:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5186. [2023-12-18 22:34:51,747 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:34:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7387 transitions. [2023-12-18 22:34:51,754 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7387 transitions. Word has length 184 [2023-12-18 22:34:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:51,755 INFO L495 AbstractCegarLoop]: Abstraction has 5186 states and 7387 transitions. [2023-12-18 22:34:51,755 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:34:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7387 transitions. [2023-12-18 22:34:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-18 22:34:51,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:51,758 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:34:51,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-18 22:34:51,758 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:51,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1442509921, now seen corresponding path program 1 times [2023-12-18 22:34:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318223233] [2023-12-18 22:34:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:34:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-18 22:34:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-18 22:34:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-18 22:34:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-18 22:34:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-18 22:34:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-18 22:34:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:34:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-18 22:34:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:34:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-18 22:34:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:34:51,826 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:34:51,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:34:51,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318223233] [2023-12-18 22:34:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318223233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:34:51,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:34:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:34:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284560512] [2023-12-18 22:34:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:34:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:34:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:34:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:34:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:34:51,828 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:34:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:34:52,182 INFO L93 Difference]: Finished difference Result 6694 states and 9047 transitions. [2023-12-18 22:34:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:34:52,182 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:34:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:34:52,189 INFO L225 Difference]: With dead ends: 6694 [2023-12-18 22:34:52,189 INFO L226 Difference]: Without dead ends: 5422 [2023-12-18 22:34:52,191 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:34:52,191 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:34:52,191 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:34:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2023-12-18 22:34:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5190. [2023-12-18 22:34:52,322 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:34:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7391 transitions. [2023-12-18 22:34:52,329 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7391 transitions. Word has length 188 [2023-12-18 22:34:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:34:52,329 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7391 transitions. [2023-12-18 22:34:52,329 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:34:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7391 transitions. [2023-12-18 22:34:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-18 22:34:52,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:34:52,332 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:34:52,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-18 22:34:52,332 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:34:52,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:34:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1297645276, now seen corresponding path program 1 times [2023-12-18 22:34:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:34:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420019889] [2023-12-18 22:34:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:34:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:34:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:34:52,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 22:34:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:34:52,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 22:34:52,425 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 22:34:52,426 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 22:34:52,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 22:34:52,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-18 22:34:52,430 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:34:52,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 22:34:52,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:34:52 BoogieIcfgContainer [2023-12-18 22:34:52,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 22:34:52,560 INFO L158 Benchmark]: Toolchain (without parser) took 65864.88ms. Allocated memory was 308.3MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 224.7MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-18 22:34:52,560 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 22:34:52,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2174.15ms. Allocated memory is still 308.3MB. Free memory was 224.2MB in the beginning and 141.9MB in the end (delta: 82.3MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2023-12-18 22:34:52,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 332.82ms. Allocated memory was 308.3MB in the beginning and 453.0MB in the end (delta: 144.7MB). Free memory was 141.9MB in the beginning and 296.0MB in the end (delta: -154.1MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2023-12-18 22:34:52,562 INFO L158 Benchmark]: Boogie Preprocessor took 586.92ms. Allocated memory is still 453.0MB. Free memory was 296.0MB in the beginning and 287.1MB in the end (delta: 8.9MB). Peak memory consumption was 93.8MB. Max. memory is 8.0GB. [2023-12-18 22:34:52,562 INFO L158 Benchmark]: RCFGBuilder took 5781.76ms. Allocated memory was 453.0MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 287.1MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 374.4MB. Max. memory is 8.0GB. [2023-12-18 22:34:52,563 INFO L158 Benchmark]: TraceAbstraction took 56982.13ms. Allocated memory was 1.5GB in the beginning and 6.0GB in the end (delta: 4.5GB). Free memory was 1.3GB in the beginning and 3.9GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-18 22:34:52,569 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2174.15ms. Allocated memory is still 308.3MB. Free memory was 224.2MB in the beginning and 141.9MB in the end (delta: 82.3MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 332.82ms. Allocated memory was 308.3MB in the beginning and 453.0MB in the end (delta: 144.7MB). Free memory was 141.9MB in the beginning and 296.0MB in the end (delta: -154.1MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 586.92ms. Allocated memory is still 453.0MB. Free memory was 296.0MB in the beginning and 287.1MB in the end (delta: 8.9MB). Peak memory consumption was 93.8MB. Max. memory is 8.0GB. * RCFGBuilder took 5781.76ms. Allocated memory was 453.0MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 287.1MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 374.4MB. Max. memory is 8.0GB. * TraceAbstraction took 56982.13ms. Allocated memory was 1.5GB in the beginning and 6.0GB in the end (delta: 4.5GB). Free memory was 1.3GB in the beginning and 3.9GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. 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: 11094]: 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: 56.8s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69527 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69380 mSDsluCounter, 316424 SdHoareTripleChecker+Invalid, 3.9s 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.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3304 GetRequests, 3107 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s 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: 20.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 21853 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s 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:34:52,586 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...