/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:30:02,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:30:02,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 01:30:02,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:30:02,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:30:02,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:30:02,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:30:02,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:30:02,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:30:02,853 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:30:02,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:30:02,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:30:02,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:30:02,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:30:02,855 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:30:02,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:30:02,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:30:02,856 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:30:02,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:30:02,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:30:02,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:30:02,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:30:02,858 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:30:02,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:30:02,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:30:02,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:30:02,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:30:02,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:30:02,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:30:02,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:30:02,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:30:02,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:30:02,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 01:30:03,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:30:03,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:30:03,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:30:03,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:30:03,090 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:30:03,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2023-12-19 01:30:04,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:30:04,604 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:30:04,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2023-12-19 01:30:04,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22eccdc3/62394ccd645c4c54948b1b9d15ef2570/FLAG93bb3cf54 [2023-12-19 01:30:04,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22eccdc3/62394ccd645c4c54948b1b9d15ef2570 [2023-12-19 01:30:04,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:30:04,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:30:04,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:30:04,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:30:04,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:30:04,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:04,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66117855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04, skipping insertion in model container [2023-12-19 01:30:04,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:04,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:30:04,803 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2023-12-19 01:30:04,841 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2023-12-19 01:30:04,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:30:04,881 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:30:04,889 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2023-12-19 01:30:04,899 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2023-12-19 01:30:04,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:30:04,932 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:30:04,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04 WrapperNode [2023-12-19 01:30:04,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:30:04,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:30:04,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:30:04,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:30:04,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:04,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:04,982 INFO L138 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 489 [2023-12-19 01:30:04,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:30:04,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:30:04,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:30:04,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:30:04,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:04,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,019 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 01:30:05,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:30:05,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:30:05,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:30:05,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:30:05,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (1/1) ... [2023-12-19 01:30:05,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:30:05,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:05,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 01:30:05,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 01:30:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:30:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:30:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:30:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:30:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:30:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:30:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:30:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:30:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:30:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:30:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:30:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:30:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-12-19 01:30:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-12-19 01:30:05,176 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:30:05,178 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:30:05,595 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:30:05,631 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:30:05,631 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-19 01:30:05,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:05 BoogieIcfgContainer [2023-12-19 01:30:05,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:30:05,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:30:05,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:30:05,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:30:05,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:30:04" (1/3) ... [2023-12-19 01:30:05,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0f20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:05, skipping insertion in model container [2023-12-19 01:30:05,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:04" (2/3) ... [2023-12-19 01:30:05,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0f20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:05, skipping insertion in model container [2023-12-19 01:30:05,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:05" (3/3) ... [2023-12-19 01:30:05,676 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2023-12-19 01:30:05,694 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:30:05,694 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:30:05,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:30:05,735 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;@3d43ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:30:05,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:30:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 152 states have (on average 1.6644736842105263) internal successors, (253), 159 states have internal predecessors, (253), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 01:30:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-19 01:30:05,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:05,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:05,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:05,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash -338499711, now seen corresponding path program 1 times [2023-12-19 01:30:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336797056] [2023-12-19 01:30:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:05,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:05,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336797056] [2023-12-19 01:30:05,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336797056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:05,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:05,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:05,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374565550] [2023-12-19 01:30:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:05,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:05,969 INFO L87 Difference]: Start difference. First operand has 189 states, 152 states have (on average 1.6644736842105263) internal successors, (253), 159 states have internal predecessors, (253), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:06,281 INFO L93 Difference]: Finished difference Result 428 states and 686 transitions. [2023-12-19 01:30:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-19 01:30:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:06,298 INFO L225 Difference]: With dead ends: 428 [2023-12-19 01:30:06,298 INFO L226 Difference]: Without dead ends: 246 [2023-12-19 01:30:06,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:06,308 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 329 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:06,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 386 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-19 01:30:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2023-12-19 01:30:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.4974874371859297) internal successors, (298), 204 states have internal predecessors, (298), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2023-12-19 01:30:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2023-12-19 01:30:06,374 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 37 [2023-12-19 01:30:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:06,375 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2023-12-19 01:30:06,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2023-12-19 01:30:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 01:30:06,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:06,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:06,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:30:06,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:06,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash -740006344, now seen corresponding path program 1 times [2023-12-19 01:30:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252714935] [2023-12-19 01:30:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-19 01:30:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252714935] [2023-12-19 01:30:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252714935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308976479] [2023-12-19 01:30:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:06,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:06,452 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:06,658 INFO L93 Difference]: Finished difference Result 474 states and 700 transitions. [2023-12-19 01:30:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-19 01:30:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:06,664 INFO L225 Difference]: With dead ends: 474 [2023-12-19 01:30:06,664 INFO L226 Difference]: Without dead ends: 363 [2023-12-19 01:30:06,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:06,667 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 342 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:06,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 377 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-19 01:30:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 340. [2023-12-19 01:30:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 286 states have (on average 1.4545454545454546) internal successors, (416), 292 states have internal predecessors, (416), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-12-19 01:30:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 496 transitions. [2023-12-19 01:30:06,712 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 496 transitions. Word has length 38 [2023-12-19 01:30:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:06,712 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 496 transitions. [2023-12-19 01:30:06,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 496 transitions. [2023-12-19 01:30:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-19 01:30:06,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:06,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:30:06,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:06,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 615283994, now seen corresponding path program 1 times [2023-12-19 01:30:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648536794] [2023-12-19 01:30:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-19 01:30:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648536794] [2023-12-19 01:30:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648536794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:06,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104009650] [2023-12-19 01:30:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:06,765 INFO L87 Difference]: Start difference. First operand 340 states and 496 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:06,953 INFO L93 Difference]: Finished difference Result 760 states and 1077 transitions. [2023-12-19 01:30:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-19 01:30:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:06,956 INFO L225 Difference]: With dead ends: 760 [2023-12-19 01:30:06,956 INFO L226 Difference]: Without dead ends: 549 [2023-12-19 01:30:06,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:06,958 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 157 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:06,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 508 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-12-19 01:30:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 445. [2023-12-19 01:30:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 379 states have (on average 1.437994722955145) internal successors, (545), 387 states have internal predecessors, (545), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2023-12-19 01:30:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 637 transitions. [2023-12-19 01:30:06,981 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 637 transitions. Word has length 39 [2023-12-19 01:30:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:06,982 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 637 transitions. [2023-12-19 01:30:06,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 01:30:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 637 transitions. [2023-12-19 01:30:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-19 01:30:06,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:06,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:30:06,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:06,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash 723271528, now seen corresponding path program 1 times [2023-12-19 01:30:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909243762] [2023-12-19 01:30:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 01:30:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:30:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909243762] [2023-12-19 01:30:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909243762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:07,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834657015] [2023-12-19 01:30:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:07,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:07,066 INFO L87 Difference]: Start difference. First operand 445 states and 637 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:07,259 INFO L93 Difference]: Finished difference Result 961 states and 1354 transitions. [2023-12-19 01:30:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-19 01:30:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:07,263 INFO L225 Difference]: With dead ends: 961 [2023-12-19 01:30:07,263 INFO L226 Difference]: Without dead ends: 645 [2023-12-19 01:30:07,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:07,265 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 142 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:07,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 555 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-12-19 01:30:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 611. [2023-12-19 01:30:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 521 states have (on average 1.383877159309021) internal successors, (721), 531 states have internal predecessors, (721), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2023-12-19 01:30:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 851 transitions. [2023-12-19 01:30:07,292 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 851 transitions. Word has length 54 [2023-12-19 01:30:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:07,293 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 851 transitions. [2023-12-19 01:30:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 851 transitions. [2023-12-19 01:30:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:30:07,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:07,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:07,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:30:07,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:07,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1733403351, now seen corresponding path program 1 times [2023-12-19 01:30:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998535335] [2023-12-19 01:30:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:30:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:30:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998535335] [2023-12-19 01:30:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998535335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289206852] [2023-12-19 01:30:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:07,343 INFO L87 Difference]: Start difference. First operand 611 states and 851 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:07,543 INFO L93 Difference]: Finished difference Result 1190 states and 1630 transitions. [2023-12-19 01:30:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-12-19 01:30:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:07,549 INFO L225 Difference]: With dead ends: 1190 [2023-12-19 01:30:07,549 INFO L226 Difference]: Without dead ends: 788 [2023-12-19 01:30:07,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:07,555 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 328 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:07,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 389 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-19 01:30:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 739. [2023-12-19 01:30:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 633 states have (on average 1.3522906793048972) internal successors, (856), 645 states have internal predecessors, (856), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2023-12-19 01:30:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1008 transitions. [2023-12-19 01:30:07,604 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1008 transitions. Word has length 59 [2023-12-19 01:30:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:07,605 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1008 transitions. [2023-12-19 01:30:07,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1008 transitions. [2023-12-19 01:30:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:30:07,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:07,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:07,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:30:07,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:07,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash -423574483, now seen corresponding path program 1 times [2023-12-19 01:30:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669413367] [2023-12-19 01:30:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:30:07,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:07,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669413367] [2023-12-19 01:30:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669413367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:07,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:07,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:30:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026669171] [2023-12-19 01:30:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:07,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:07,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:07,682 INFO L87 Difference]: Start difference. First operand 739 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:07,900 INFO L93 Difference]: Finished difference Result 1225 states and 1670 transitions. [2023-12-19 01:30:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:30:07,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-19 01:30:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:07,903 INFO L225 Difference]: With dead ends: 1225 [2023-12-19 01:30:07,903 INFO L226 Difference]: Without dead ends: 687 [2023-12-19 01:30:07,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:07,905 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 94 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:07,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 649 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-19 01:30:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 614. [2023-12-19 01:30:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 525 states have (on average 1.3504761904761904) internal successors, (709), 536 states have internal predecessors, (709), 54 states have call successors, (54), 30 states have call predecessors, (54), 33 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-19 01:30:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 833 transitions. [2023-12-19 01:30:07,927 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 833 transitions. Word has length 60 [2023-12-19 01:30:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:07,927 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 833 transitions. [2023-12-19 01:30:07,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 833 transitions. [2023-12-19 01:30:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:30:07,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:07,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:07,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:30:07,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:07,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1374065133, now seen corresponding path program 1 times [2023-12-19 01:30:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186424132] [2023-12-19 01:30:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 01:30:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186424132] [2023-12-19 01:30:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186424132] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4174314] [2023-12-19 01:30:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:07,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:08,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 01:30:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:08,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 01:30:08,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4174314] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-19 01:30:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162530247] [2023-12-19 01:30:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:08,109 INFO L87 Difference]: Start difference. First operand 614 states and 833 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:08,168 INFO L93 Difference]: Finished difference Result 1011 states and 1370 transitions. [2023-12-19 01:30:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-19 01:30:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:08,170 INFO L225 Difference]: With dead ends: 1011 [2023-12-19 01:30:08,170 INFO L226 Difference]: Without dead ends: 612 [2023-12-19 01:30:08,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:08,172 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 66 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:08,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 517 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2023-12-19 01:30:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 574. [2023-12-19 01:30:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 491 states have (on average 1.329938900203666) internal successors, (653), 502 states have internal predecessors, (653), 50 states have call successors, (50), 28 states have call predecessors, (50), 31 states have return successors, (64), 44 states have call predecessors, (64), 46 states have call successors, (64) [2023-12-19 01:30:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 767 transitions. [2023-12-19 01:30:08,190 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 767 transitions. Word has length 60 [2023-12-19 01:30:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:08,190 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 767 transitions. [2023-12-19 01:30:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 01:30:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 767 transitions. [2023-12-19 01:30:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:30:08,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:08,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:08,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:08,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:08,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:08,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1850478484, now seen corresponding path program 1 times [2023-12-19 01:30:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081069529] [2023-12-19 01:30:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 01:30:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081069529] [2023-12-19 01:30:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081069529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655917175] [2023-12-19 01:30:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:08,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:08,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 01:30:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:08,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:30:08,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:08,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:30:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 01:30:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655917175] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:08,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-19 01:30:08,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-19 01:30:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904991420] [2023-12-19 01:30:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:08,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:08,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:08,746 INFO L87 Difference]: Start difference. First operand 574 states and 767 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:08,843 INFO L93 Difference]: Finished difference Result 619 states and 822 transitions. [2023-12-19 01:30:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:30:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-19 01:30:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:08,845 INFO L225 Difference]: With dead ends: 619 [2023-12-19 01:30:08,846 INFO L226 Difference]: Without dead ends: 616 [2023-12-19 01:30:08,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:30:08,846 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 456 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:08,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 318 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-12-19 01:30:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 573. [2023-12-19 01:30:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 491 states have (on average 1.3258655804480652) internal successors, (651), 501 states have internal predecessors, (651), 49 states have call successors, (49), 28 states have call predecessors, (49), 31 states have return successors, (64), 44 states have call predecessors, (64), 46 states have call successors, (64) [2023-12-19 01:30:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 764 transitions. [2023-12-19 01:30:08,868 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 764 transitions. Word has length 60 [2023-12-19 01:30:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:08,869 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 764 transitions. [2023-12-19 01:30:08,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 01:30:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 764 transitions. [2023-12-19 01:30:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:08,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:08,870 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-19 01:30:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:09,076 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-19 01:30:09,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:09,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1339637393, now seen corresponding path program 1 times [2023-12-19 01:30:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090447993] [2023-12-19 01:30:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090447993] [2023-12-19 01:30:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090447993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:30:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934408285] [2023-12-19 01:30:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:30:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:30:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:09,154 INFO L87 Difference]: Start difference. First operand 573 states and 764 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-19 01:30:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:09,696 INFO L93 Difference]: Finished difference Result 862 states and 1214 transitions. [2023-12-19 01:30:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:30:09,696 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-19 01:30:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:09,700 INFO L225 Difference]: With dead ends: 862 [2023-12-19 01:30:09,700 INFO L226 Difference]: Without dead ends: 747 [2023-12-19 01:30:09,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:30:09,701 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 533 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:09,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 576 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:30:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2023-12-19 01:30:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 686. [2023-12-19 01:30:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 586 states have (on average 1.363481228668942) internal successors, (799), 597 states have internal predecessors, (799), 60 states have call successors, (60), 34 states have call predecessors, (60), 38 states have return successors, (78), 55 states have call predecessors, (78), 57 states have call successors, (78) [2023-12-19 01:30:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 937 transitions. [2023-12-19 01:30:09,787 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 937 transitions. Word has length 62 [2023-12-19 01:30:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:09,788 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 937 transitions. [2023-12-19 01:30:09,788 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-19 01:30:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 937 transitions. [2023-12-19 01:30:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:09,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:09,791 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-19 01:30:09,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:30:09,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:09,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 792730287, now seen corresponding path program 1 times [2023-12-19 01:30:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:09,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065650747] [2023-12-19 01:30:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:09,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065650747] [2023-12-19 01:30:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065650747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527475788] [2023-12-19 01:30:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:09,979 INFO L87 Difference]: Start difference. First operand 686 states and 937 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-19 01:30:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:10,752 INFO L93 Difference]: Finished difference Result 1117 states and 1600 transitions. [2023-12-19 01:30:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:30:10,753 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-19 01:30:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:10,757 INFO L225 Difference]: With dead ends: 1117 [2023-12-19 01:30:10,757 INFO L226 Difference]: Without dead ends: 889 [2023-12-19 01:30:10,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:30:10,759 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 526 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:10,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 970 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:30:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-12-19 01:30:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 792. [2023-12-19 01:30:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 674 states have (on average 1.3842729970326408) internal successors, (933), 686 states have internal predecessors, (933), 71 states have call successors, (71), 40 states have call predecessors, (71), 45 states have return successors, (91), 67 states have call predecessors, (91), 68 states have call successors, (91) [2023-12-19 01:30:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1095 transitions. [2023-12-19 01:30:10,860 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1095 transitions. Word has length 62 [2023-12-19 01:30:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:10,860 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 1095 transitions. [2023-12-19 01:30:10,860 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-19 01:30:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1095 transitions. [2023-12-19 01:30:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:10,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:10,862 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-19 01:30:10,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:30:10,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:10,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 311650029, now seen corresponding path program 1 times [2023-12-19 01:30:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913871926] [2023-12-19 01:30:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913871926] [2023-12-19 01:30:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913871926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518681785] [2023-12-19 01:30:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:10,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:10,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:10,963 INFO L87 Difference]: Start difference. First operand 792 states and 1095 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-19 01:30:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:11,770 INFO L93 Difference]: Finished difference Result 1490 states and 2166 transitions. [2023-12-19 01:30:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:30:11,771 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-19 01:30:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:11,775 INFO L225 Difference]: With dead ends: 1490 [2023-12-19 01:30:11,775 INFO L226 Difference]: Without dead ends: 1156 [2023-12-19 01:30:11,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:30:11,777 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 524 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:11,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 968 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:30:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2023-12-19 01:30:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1005. [2023-12-19 01:30:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 851 states have (on average 1.4124559341950647) internal successors, (1202), 865 states have internal predecessors, (1202), 93 states have call successors, (93), 52 states have call predecessors, (93), 59 states have return successors, (121), 91 states have call predecessors, (121), 90 states have call successors, (121) [2023-12-19 01:30:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1416 transitions. [2023-12-19 01:30:11,835 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1416 transitions. Word has length 62 [2023-12-19 01:30:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:11,835 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1416 transitions. [2023-12-19 01:30:11,835 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-19 01:30:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1416 transitions. [2023-12-19 01:30:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:11,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:11,836 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-19 01:30:11,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:30:11,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:11,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash 296131311, now seen corresponding path program 1 times [2023-12-19 01:30:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054767106] [2023-12-19 01:30:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054767106] [2023-12-19 01:30:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054767106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:11,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517486984] [2023-12-19 01:30:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:11,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:11,916 INFO L87 Difference]: Start difference. First operand 1005 states and 1416 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-19 01:30:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:12,746 INFO L93 Difference]: Finished difference Result 2339 states and 3453 transitions. [2023-12-19 01:30:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:30:12,746 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-19 01:30:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:12,752 INFO L225 Difference]: With dead ends: 2339 [2023-12-19 01:30:12,752 INFO L226 Difference]: Without dead ends: 1792 [2023-12-19 01:30:12,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:30:12,754 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 604 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:12,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 961 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:30:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-12-19 01:30:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1424. [2023-12-19 01:30:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1202 states have (on average 1.4442595673876872) internal successors, (1736), 1220 states have internal predecessors, (1736), 133 states have call successors, (133), 76 states have call predecessors, (133), 87 states have return successors, (183), 135 states have call predecessors, (183), 130 states have call successors, (183) [2023-12-19 01:30:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2052 transitions. [2023-12-19 01:30:12,815 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2052 transitions. Word has length 62 [2023-12-19 01:30:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:12,816 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 2052 transitions. [2023-12-19 01:30:12,816 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-19 01:30:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2052 transitions. [2023-12-19 01:30:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:12,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:12,817 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-19 01:30:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:30:12,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:12,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2059673939, now seen corresponding path program 1 times [2023-12-19 01:30:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891383095] [2023-12-19 01:30:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891383095] [2023-12-19 01:30:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891383095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594013863] [2023-12-19 01:30:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:12,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:12,888 INFO L87 Difference]: Start difference. First operand 1424 states and 2052 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-19 01:30:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:13,887 INFO L93 Difference]: Finished difference Result 3796 states and 5671 transitions. [2023-12-19 01:30:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:30:13,888 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-19 01:30:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:13,899 INFO L225 Difference]: With dead ends: 3796 [2023-12-19 01:30:13,899 INFO L226 Difference]: Without dead ends: 2830 [2023-12-19 01:30:13,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:30:13,903 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 526 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:13,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 957 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:30:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2023-12-19 01:30:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2179. [2023-12-19 01:30:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1825 states have (on average 1.4586301369863013) internal successors, (2662), 1851 states have internal predecessors, (2662), 209 states have call successors, (209), 124 states have call predecessors, (209), 143 states have return successors, (321), 219 states have call predecessors, (321), 206 states have call successors, (321) [2023-12-19 01:30:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3192 transitions. [2023-12-19 01:30:14,015 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3192 transitions. Word has length 62 [2023-12-19 01:30:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:14,016 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 3192 transitions. [2023-12-19 01:30:14,016 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-19 01:30:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3192 transitions. [2023-12-19 01:30:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:14,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:14,018 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-19 01:30:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:30:14,018 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:14,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1882204975, now seen corresponding path program 1 times [2023-12-19 01:30:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109496238] [2023-12-19 01:30:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109496238] [2023-12-19 01:30:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109496238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:30:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887802920] [2023-12-19 01:30:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:30:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:30:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:14,087 INFO L87 Difference]: Start difference. First operand 2179 states and 3192 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-19 01:30:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:14,567 INFO L93 Difference]: Finished difference Result 4277 states and 6444 transitions. [2023-12-19 01:30:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:30:14,567 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-19 01:30:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:14,577 INFO L225 Difference]: With dead ends: 4277 [2023-12-19 01:30:14,577 INFO L226 Difference]: Without dead ends: 2556 [2023-12-19 01:30:14,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:30:14,581 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 439 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:14,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 583 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2023-12-19 01:30:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2179. [2023-12-19 01:30:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1825 states have (on average 1.4493150684931506) internal successors, (2645), 1851 states have internal predecessors, (2645), 209 states have call successors, (209), 124 states have call predecessors, (209), 143 states have return successors, (321), 219 states have call predecessors, (321), 206 states have call successors, (321) [2023-12-19 01:30:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3175 transitions. [2023-12-19 01:30:14,736 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3175 transitions. Word has length 62 [2023-12-19 01:30:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:14,737 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 3175 transitions. [2023-12-19 01:30:14,737 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-19 01:30:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3175 transitions. [2023-12-19 01:30:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:30:14,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:14,739 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-19 01:30:14,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 01:30:14,739 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:14,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -484489619, now seen corresponding path program 1 times [2023-12-19 01:30:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245287137] [2023-12-19 01:30:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:14,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245287137] [2023-12-19 01:30:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245287137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:14,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:30:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336206917] [2023-12-19 01:30:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:30:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:30:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:14,828 INFO L87 Difference]: Start difference. First operand 2179 states and 3175 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-19 01:30:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:15,548 INFO L93 Difference]: Finished difference Result 5309 states and 7894 transitions. [2023-12-19 01:30:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:30:15,549 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-19 01:30:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:15,563 INFO L225 Difference]: With dead ends: 5309 [2023-12-19 01:30:15,563 INFO L226 Difference]: Without dead ends: 3589 [2023-12-19 01:30:15,567 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-19 01:30:15,568 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 652 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:15,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 696 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:30:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2023-12-19 01:30:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3042. [2023-12-19 01:30:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2530 states have (on average 1.4434782608695653) internal successors, (3652), 2573 states have internal predecessors, (3652), 305 states have call successors, (305), 178 states have call predecessors, (305), 205 states have return successors, (445), 306 states have call predecessors, (445), 302 states have call successors, (445) [2023-12-19 01:30:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4402 transitions. [2023-12-19 01:30:15,715 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4402 transitions. Word has length 62 [2023-12-19 01:30:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:15,715 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 4402 transitions. [2023-12-19 01:30:15,715 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-19 01:30:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4402 transitions. [2023-12-19 01:30:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-19 01:30:15,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:15,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:15,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 01:30:15,718 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:15,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1530948198, now seen corresponding path program 1 times [2023-12-19 01:30:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555047639] [2023-12-19 01:30:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-19 01:30:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 01:30:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555047639] [2023-12-19 01:30:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555047639] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107161272] [2023-12-19 01:30:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:15,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:15,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:15,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:15,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 01:30:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:15,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 01:30:15,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:30:16,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:30:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 01:30:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107161272] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:30:16,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:30:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2023-12-19 01:30:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630985672] [2023-12-19 01:30:16,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:30:16,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:30:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:30:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:30:16,065 INFO L87 Difference]: Start difference. First operand 3042 states and 4402 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-19 01:30:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:16,744 INFO L93 Difference]: Finished difference Result 4108 states and 5798 transitions. [2023-12-19 01:30:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 01:30:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2023-12-19 01:30:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:16,757 INFO L225 Difference]: With dead ends: 4108 [2023-12-19 01:30:16,757 INFO L226 Difference]: Without dead ends: 3752 [2023-12-19 01:30:16,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-19 01:30:16,760 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 710 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:16,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1381 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:30:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2023-12-19 01:30:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3361. [2023-12-19 01:30:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 2812 states have (on average 1.4238975817923187) internal successors, (4004), 2862 states have internal predecessors, (4004), 324 states have call successors, (324), 191 states have call predecessors, (324), 223 states have return successors, (476), 323 states have call predecessors, (476), 321 states have call successors, (476) [2023-12-19 01:30:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4804 transitions. [2023-12-19 01:30:16,964 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4804 transitions. Word has length 61 [2023-12-19 01:30:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:16,964 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 4804 transitions. [2023-12-19 01:30:16,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-19 01:30:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4804 transitions. [2023-12-19 01:30:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-19 01:30:16,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:16,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:16,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:17,176 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:17,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -876360830, now seen corresponding path program 1 times [2023-12-19 01:30:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687854809] [2023-12-19 01:30:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-19 01:30:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-19 01:30:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687854809] [2023-12-19 01:30:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687854809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:17,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:17,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 01:30:17,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050833955] [2023-12-19 01:30:17,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:17,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:30:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:30:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 01:30:17,209 INFO L87 Difference]: Start difference. First operand 3361 states and 4804 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 01:30:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:17,489 INFO L93 Difference]: Finished difference Result 3963 states and 5567 transitions. [2023-12-19 01:30:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:30:17,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-19 01:30:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:17,507 INFO L225 Difference]: With dead ends: 3963 [2023-12-19 01:30:17,507 INFO L226 Difference]: Without dead ends: 3368 [2023-12-19 01:30:17,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:17,509 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 336 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:17,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 399 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2023-12-19 01:30:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3297. [2023-12-19 01:30:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2755 states have (on average 1.4243194192377495) internal successors, (3924), 2805 states have internal predecessors, (3924), 321 states have call successors, (321), 188 states have call predecessors, (321), 219 states have return successors, (471), 319 states have call predecessors, (471), 318 states have call successors, (471) [2023-12-19 01:30:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4716 transitions. [2023-12-19 01:30:17,707 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4716 transitions. Word has length 78 [2023-12-19 01:30:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 3297 states and 4716 transitions. [2023-12-19 01:30:17,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 01:30:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4716 transitions. [2023-12-19 01:30:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-19 01:30:17,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:17,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:30:17,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 01:30:17,715 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:17,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2102498243, now seen corresponding path program 1 times [2023-12-19 01:30:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811112128] [2023-12-19 01:30:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 01:30:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 01:30:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-19 01:30:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 01:30:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 01:30:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:30:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811112128] [2023-12-19 01:30:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811112128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:17,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036947986] [2023-12-19 01:30:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:17,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:17,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:17,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:17,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 01:30:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:17,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:17,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:30:17,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036947986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-19 01:30:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437177269] [2023-12-19 01:30:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:17,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:17,947 INFO L87 Difference]: Start difference. First operand 3297 states and 4716 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-19 01:30:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:18,126 INFO L93 Difference]: Finished difference Result 3580 states and 5067 transitions. [2023-12-19 01:30:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2023-12-19 01:30:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:18,133 INFO L225 Difference]: With dead ends: 3580 [2023-12-19 01:30:18,134 INFO L226 Difference]: Without dead ends: 2593 [2023-12-19 01:30:18,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:30:18,136 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 54 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:18,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 507 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2023-12-19 01:30:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2593. [2023-12-19 01:30:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2138 states have (on average 1.4752104770813845) internal successors, (3154), 2173 states have internal predecessors, (3154), 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-19 01:30:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3825 transitions. [2023-12-19 01:30:18,247 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3825 transitions. Word has length 92 [2023-12-19 01:30:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:18,248 INFO L495 AbstractCegarLoop]: Abstraction has 2593 states and 3825 transitions. [2023-12-19 01:30:18,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-19 01:30:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3825 transitions. [2023-12-19 01:30:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 01:30:18,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:18,252 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-19 01:30:18,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:18,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-19 01:30:18,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:18,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -33527341, now seen corresponding path program 1 times [2023-12-19 01:30:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735947409] [2023-12-19 01:30:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:30:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,538 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-19 01:30:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735947409] [2023-12-19 01:30:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735947409] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684691555] [2023-12-19 01:30:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:18,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:18,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 01:30:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:18,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:18,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 01:30:18,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684691555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:30:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755515946] [2023-12-19 01:30:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:18,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:18,765 INFO L87 Difference]: Start difference. First operand 2593 states and 3825 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-19 01:30:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:19,048 INFO L93 Difference]: Finished difference Result 7678 states and 11405 transitions. [2023-12-19 01:30:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:19,048 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-19 01:30:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:19,071 INFO L225 Difference]: With dead ends: 7678 [2023-12-19 01:30:19,071 INFO L226 Difference]: Without dead ends: 5095 [2023-12-19 01:30:19,078 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-19 01:30:19,079 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 146 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:19,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 319 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2023-12-19 01:30:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5065. [2023-12-19 01:30:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 4176 states have (on average 1.4671934865900382) internal successors, (6127), 4244 states have internal predecessors, (6127), 528 states have call successors, (528), 313 states have call predecessors, (528), 360 states have return successors, (761), 523 states have call predecessors, (761), 526 states have call successors, (761) [2023-12-19 01:30:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7416 transitions. [2023-12-19 01:30:19,355 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7416 transitions. Word has length 100 [2023-12-19 01:30:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:19,356 INFO L495 AbstractCegarLoop]: Abstraction has 5065 states and 7416 transitions. [2023-12-19 01:30:19,356 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-19 01:30:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7416 transitions. [2023-12-19 01:30:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 01:30:19,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:19,364 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-19 01:30:19,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:19,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:19,571 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:19,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 795662515, now seen corresponding path program 1 times [2023-12-19 01:30:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912342723] [2023-12-19 01:30:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:30:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,650 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-19 01:30:19,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912342723] [2023-12-19 01:30:19,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912342723] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531684197] [2023-12-19 01:30:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:19,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:19,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 01:30:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:19,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:19,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:30:19,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531684197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:19,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395584324] [2023-12-19 01:30:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:19,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:19,790 INFO L87 Difference]: Start difference. First operand 5065 states and 7416 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-19 01:30:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:20,315 INFO L93 Difference]: Finished difference Result 14819 states and 21966 transitions. [2023-12-19 01:30:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:20,316 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-19 01:30:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:20,343 INFO L225 Difference]: With dead ends: 14819 [2023-12-19 01:30:20,344 INFO L226 Difference]: Without dead ends: 9765 [2023-12-19 01:30:20,355 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-19 01:30:20,356 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 144 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:20,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 475 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:30:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9765 states. [2023-12-19 01:30:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9765 to 9765. [2023-12-19 01:30:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9765 states, 8027 states have (on average 1.4508533698766664) internal successors, (11646), 8144 states have internal predecessors, (11646), 1017 states have call successors, (1017), 625 states have call predecessors, (1017), 720 states have return successors, (1660), 1027 states have call predecessors, (1660), 1015 states have call successors, (1660) [2023-12-19 01:30:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 14323 transitions. [2023-12-19 01:30:21,007 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 14323 transitions. Word has length 100 [2023-12-19 01:30:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:21,008 INFO L495 AbstractCegarLoop]: Abstraction has 9765 states and 14323 transitions. [2023-12-19 01:30:21,008 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-19 01:30:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 14323 transitions. [2023-12-19 01:30:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 01:30:21,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:21,040 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-19 01:30:21,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:21,247 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:21,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 730759685, now seen corresponding path program 1 times [2023-12-19 01:30:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:21,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909504496] [2023-12-19 01:30:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:30:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:30:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,362 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-19 01:30:21,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909504496] [2023-12-19 01:30:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909504496] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634081520] [2023-12-19 01:30:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:21,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 01:30:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:21,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:21,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:21,554 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-19 01:30:21,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634081520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:30:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284490880] [2023-12-19 01:30:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:21,555 INFO L87 Difference]: Start difference. First operand 9765 states and 14323 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-19 01:30:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:22,408 INFO L93 Difference]: Finished difference Result 28697 states and 42336 transitions. [2023-12-19 01:30:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:22,408 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-19 01:30:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:22,477 INFO L225 Difference]: With dead ends: 28697 [2023-12-19 01:30:22,477 INFO L226 Difference]: Without dead ends: 18947 [2023-12-19 01:30:22,508 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-19 01:30:22,509 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 107 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:22,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 340 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18947 states. [2023-12-19 01:30:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18947 to 18839. [2023-12-19 01:30:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18839 states, 15577 states have (on average 1.4443089169930026) internal successors, (22498), 15808 states have internal predecessors, (22498), 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-19 01:30:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18839 states to 18839 states and 27407 transitions. [2023-12-19 01:30:23,742 INFO L78 Accepts]: Start accepts. Automaton has 18839 states and 27407 transitions. Word has length 128 [2023-12-19 01:30:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:23,743 INFO L495 AbstractCegarLoop]: Abstraction has 18839 states and 27407 transitions. [2023-12-19 01:30:23,743 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-19 01:30:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18839 states and 27407 transitions. [2023-12-19 01:30:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:30:23,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:23,797 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-19 01:30:23,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-19 01:30:24,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:24,004 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:24,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash -381603350, now seen corresponding path program 1 times [2023-12-19 01:30:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:24,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796340072] [2023-12-19 01:30:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:24,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:30:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:30:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:30:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:30:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,143 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-19 01:30:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796340072] [2023-12-19 01:30:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796340072] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034302881] [2023-12-19 01:30:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:24,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 01:30:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:24,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:24,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:24,313 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-19 01:30:24,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034302881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64176839] [2023-12-19 01:30:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:24,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:24,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:24,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:24,315 INFO L87 Difference]: Start difference. First operand 18839 states and 27407 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-19 01:30:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:25,187 INFO L93 Difference]: Finished difference Result 29845 states and 43775 transitions. [2023-12-19 01:30:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:25,188 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-19 01:30:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:25,247 INFO L225 Difference]: With dead ends: 29845 [2023-12-19 01:30:25,247 INFO L226 Difference]: Without dead ends: 16519 [2023-12-19 01:30:25,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:25,282 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 124 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:25,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16519 states. [2023-12-19 01:30:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16519 to 12075. [2023-12-19 01:30:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12075 states, 10021 states have (on average 1.397864484582377) internal successors, (14008), 10142 states have internal predecessors, (14008), 1163 states have call successors, (1163), 795 states have call predecessors, (1163), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2023-12-19 01:30:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 16819 transitions. [2023-12-19 01:30:26,323 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 16819 transitions. Word has length 144 [2023-12-19 01:30:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:26,323 INFO L495 AbstractCegarLoop]: Abstraction has 12075 states and 16819 transitions. [2023-12-19 01:30:26,323 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-19 01:30:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 16819 transitions. [2023-12-19 01:30:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:30:26,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:26,344 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-19 01:30:26,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:26,551 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,SelfDestructingSolverStorable21 [2023-12-19 01:30:26,551 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:26,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1891676725, now seen corresponding path program 1 times [2023-12-19 01:30:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520859567] [2023-12-19 01:30:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:30:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:30:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:30:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:30:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,636 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-19 01:30:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520859567] [2023-12-19 01:30:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520859567] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055615254] [2023-12-19 01:30:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:26,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:26,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:26,638 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:26,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 01:30:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:26,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:26,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:26,788 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-19 01:30:26,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:26,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055615254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:26,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:26,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030728005] [2023-12-19 01:30:26,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:26,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:26,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:26,790 INFO L87 Difference]: Start difference. First operand 12075 states and 16819 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-19 01:30:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:27,287 INFO L93 Difference]: Finished difference Result 21324 states and 29695 transitions. [2023-12-19 01:30:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:27,287 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-19 01:30:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:27,325 INFO L225 Difference]: With dead ends: 21324 [2023-12-19 01:30:27,325 INFO L226 Difference]: Without dead ends: 12899 [2023-12-19 01:30:27,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:27,346 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 121 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 354 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-19 01:30:27,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 354 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12899 states. [2023-12-19 01:30:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12899 to 12833. [2023-12-19 01:30:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12833 states, 10691 states have (on average 1.372743429052474) internal successors, (14676), 10812 states have internal predecessors, (14676), 1185 states have call successors, (1185), 861 states have call predecessors, (1185), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2023-12-19 01:30:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12833 states to 12833 states and 17597 transitions. [2023-12-19 01:30:28,275 INFO L78 Accepts]: Start accepts. Automaton has 12833 states and 17597 transitions. Word has length 144 [2023-12-19 01:30:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:28,275 INFO L495 AbstractCegarLoop]: Abstraction has 12833 states and 17597 transitions. [2023-12-19 01:30:28,276 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-19 01:30:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12833 states and 17597 transitions. [2023-12-19 01:30:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:30:28,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:28,303 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-19 01:30:28,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:28,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:28,510 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:28,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 658090459, now seen corresponding path program 1 times [2023-12-19 01:30:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559765876] [2023-12-19 01:30:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:30:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:30:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:30:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,600 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-19 01:30:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559765876] [2023-12-19 01:30:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559765876] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256981691] [2023-12-19 01:30:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:28,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:28,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 01:30:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:28,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:28,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:28,784 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-19 01:30:28,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256981691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:28,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773214507] [2023-12-19 01:30:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:28,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:28,785 INFO L87 Difference]: Start difference. First operand 12833 states and 17597 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-19 01:30:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:29,994 INFO L93 Difference]: Finished difference Result 37679 states and 52207 transitions. [2023-12-19 01:30:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:29,995 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-19 01:30:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:30,096 INFO L225 Difference]: With dead ends: 37679 [2023-12-19 01:30:30,096 INFO L226 Difference]: Without dead ends: 24863 [2023-12-19 01:30:30,124 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-19 01:30:30,124 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 154 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 480 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-19 01:30:30,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 480 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24863 states. [2023-12-19 01:30:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24863 to 24815. [2023-12-19 01:30:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24815 states, 20715 states have (on average 1.3614289162442674) internal successors, (28202), 20956 states have internal predecessors, (28202), 2247 states have call successors, (2247), 1661 states have call predecessors, (2247), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2023-12-19 01:30:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24815 states to 24815 states and 34247 transitions. [2023-12-19 01:30:31,871 INFO L78 Accepts]: Start accepts. Automaton has 24815 states and 34247 transitions. Word has length 145 [2023-12-19 01:30:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:31,871 INFO L495 AbstractCegarLoop]: Abstraction has 24815 states and 34247 transitions. [2023-12-19 01:30:31,871 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-19 01:30:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24815 states and 34247 transitions. [2023-12-19 01:30:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:30:31,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:31,908 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-19 01:30:31,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 01:30:32,128 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,SelfDestructingSolverStorable23 [2023-12-19 01:30:32,128 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:32,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1237218634, now seen corresponding path program 1 times [2023-12-19 01:30:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883196275] [2023-12-19 01:30:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:30:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:30:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:30:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,218 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-19 01:30:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883196275] [2023-12-19 01:30:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883196275] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351553964] [2023-12-19 01:30:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:32,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:32,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 01:30:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:32,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:32,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:32,399 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-19 01:30:32,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:32,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351553964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:32,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:32,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:32,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193829514] [2023-12-19 01:30:32,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:32,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:32,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:32,401 INFO L87 Difference]: Start difference. First operand 24815 states and 34247 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-19 01:30:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:33,850 INFO L93 Difference]: Finished difference Result 50777 states and 71564 transitions. [2023-12-19 01:30:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:33,851 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-19 01:30:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:33,934 INFO L225 Difference]: With dead ends: 50777 [2023-12-19 01:30:33,934 INFO L226 Difference]: Without dead ends: 25989 [2023-12-19 01:30:33,964 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-19 01:30:33,965 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:33,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25989 states. [2023-12-19 01:30:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25989 to 25945. [2023-12-19 01:30:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25945 states, 21785 states have (on average 1.326141840716089) internal successors, (28890), 22026 states have internal predecessors, (28890), 2247 states have call successors, (2247), 1721 states have call predecessors, (2247), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2023-12-19 01:30:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 34891 transitions. [2023-12-19 01:30:35,382 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 34891 transitions. Word has length 145 [2023-12-19 01:30:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:35,382 INFO L495 AbstractCegarLoop]: Abstraction has 25945 states and 34891 transitions. [2023-12-19 01:30:35,383 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-19 01:30:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 34891 transitions. [2023-12-19 01:30:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:30:35,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:35,418 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-19 01:30:35,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:35,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:30:35,624 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:35,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1992959625, now seen corresponding path program 1 times [2023-12-19 01:30:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:35,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839645989] [2023-12-19 01:30:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:30:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:30:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:30:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:30:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,706 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-19 01:30:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839645989] [2023-12-19 01:30:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839645989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808230793] [2023-12-19 01:30:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:35,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:35,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:35,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 01:30:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:35,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:30:35,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:30:35,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808230793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333380663] [2023-12-19 01:30:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:35,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:35,840 INFO L87 Difference]: Start difference. First operand 25945 states and 34891 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-19 01:30:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:38,125 INFO L93 Difference]: Finished difference Result 74085 states and 100923 transitions. [2023-12-19 01:30:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:38,125 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-19 01:30:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:38,247 INFO L225 Difference]: With dead ends: 74085 [2023-12-19 01:30:38,248 INFO L226 Difference]: Without dead ends: 48167 [2023-12-19 01:30:38,292 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-19 01:30:38,292 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 143 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 477 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-19 01:30:38,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 477 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48167 states. [2023-12-19 01:30:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48167 to 48163. [2023-12-19 01:30:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 40295 states have (on average 1.3133639409356) internal successors, (52922), 40776 states have internal predecessors, (52922), 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-19 01:30:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 65389 transitions. [2023-12-19 01:30:40,941 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 65389 transitions. Word has length 145 [2023-12-19 01:30:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:40,942 INFO L495 AbstractCegarLoop]: Abstraction has 48163 states and 65389 transitions. [2023-12-19 01:30:40,942 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-19 01:30:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 65389 transitions. [2023-12-19 01:30:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:30:41,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:41,005 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-19 01:30:41,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-19 01:30:41,211 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:41,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 731528452, now seen corresponding path program 1 times [2023-12-19 01:30:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858907747] [2023-12-19 01:30:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:30:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:30:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:30:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:30:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,289 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-19 01:30:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858907747] [2023-12-19 01:30:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858907747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069962242] [2023-12-19 01:30:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:41,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:41,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 01:30:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:41,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:41,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:41,442 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-19 01:30:41,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:41,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069962242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:41,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:41,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382505789] [2023-12-19 01:30:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:41,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:41,443 INFO L87 Difference]: Start difference. First operand 48163 states and 65389 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-19 01:30:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:44,116 INFO L93 Difference]: Finished difference Result 85299 states and 116023 transitions. [2023-12-19 01:30:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:44,117 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-19 01:30:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:44,299 INFO L225 Difference]: With dead ends: 85299 [2023-12-19 01:30:44,299 INFO L226 Difference]: Without dead ends: 48839 [2023-12-19 01:30:44,358 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-19 01:30:44,360 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 138 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 343 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.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:30:44,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 343 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48839 states. [2023-12-19 01:30:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48839 to 48163. [2023-12-19 01:30:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 40295 states have (on average 1.3044298300037225) internal successors, (52562), 40776 states have internal predecessors, (52562), 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-19 01:30:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 65029 transitions. [2023-12-19 01:30:47,231 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 65029 transitions. Word has length 146 [2023-12-19 01:30:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:47,231 INFO L495 AbstractCegarLoop]: Abstraction has 48163 states and 65029 transitions. [2023-12-19 01:30:47,231 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-19 01:30:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 65029 transitions. [2023-12-19 01:30:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:30:47,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:47,297 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-19 01:30:47,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-19 01:30:47,503 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,SelfDestructingSolverStorable26 [2023-12-19 01:30:47,503 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:47,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 144865972, now seen corresponding path program 1 times [2023-12-19 01:30:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779558124] [2023-12-19 01:30:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:30:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:30:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:30:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:30:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,588 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-19 01:30:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779558124] [2023-12-19 01:30:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779558124] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:30:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720123173] [2023-12-19 01:30:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:47,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:30:47,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:30:47,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 01:30:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:47,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:30:47,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:30:47,751 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-19 01:30:47,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:30:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720123173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:30:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:30:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611981861] [2023-12-19 01:30:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:30:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:30:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:30:47,753 INFO L87 Difference]: Start difference. First operand 48163 states and 65029 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-19 01:30:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:50,053 INFO L93 Difference]: Finished difference Result 86655 states and 117383 transitions. [2023-12-19 01:30:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:30:50,054 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-19 01:30:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:50,319 INFO L225 Difference]: With dead ends: 86655 [2023-12-19 01:30:50,319 INFO L226 Difference]: Without dead ends: 49423 [2023-12-19 01:30:50,368 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-19 01:30:50,369 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 139 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 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-19 01:30:50,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:30:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49423 states. [2023-12-19 01:30:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49423 to 48043. [2023-12-19 01:30:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48043 states, 40175 states have (on average 1.2963783447417547) internal successors, (52082), 40656 states have internal predecessors, (52082), 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-19 01:30:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48043 states to 48043 states and 64549 transitions. [2023-12-19 01:30:53,130 INFO L78 Accepts]: Start accepts. Automaton has 48043 states and 64549 transitions. Word has length 146 [2023-12-19 01:30:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:53,131 INFO L495 AbstractCegarLoop]: Abstraction has 48043 states and 64549 transitions. [2023-12-19 01:30:53,131 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-19 01:30:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 48043 states and 64549 transitions. [2023-12-19 01:30:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:30:53,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:53,185 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-19 01:30:53,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-19 01:30:53,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:30:53,391 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:53,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -348549116, now seen corresponding path program 1 times [2023-12-19 01:30:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133307266] [2023-12-19 01:30:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:30:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:30:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:30:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:30:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:53,451 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-19 01:30:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133307266] [2023-12-19 01:30:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133307266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:30:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016420615] [2023-12-19 01:30:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:53,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:53,453 INFO L87 Difference]: Start difference. First operand 48043 states and 64549 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-19 01:30:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:30:55,970 INFO L93 Difference]: Finished difference Result 92743 states and 123560 transitions. [2023-12-19 01:30:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:30:55,970 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-19 01:30:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:30:56,110 INFO L225 Difference]: With dead ends: 92743 [2023-12-19 01:30:56,111 INFO L226 Difference]: Without dead ends: 44723 [2023-12-19 01:30:56,164 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-19 01:30:56,165 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 287 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 234 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-19 01:30:56,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 234 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:30:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44723 states. [2023-12-19 01:30:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44723 to 42111. [2023-12-19 01:30:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42111 states, 35479 states have (on average 1.2991346993996449) internal successors, (46092), 36354 states have internal predecessors, (46092), 3183 states have call successors, (3183), 2417 states have call predecessors, (3183), 3448 states have return successors, (6605), 3371 states have call predecessors, (6605), 3181 states have call successors, (6605) [2023-12-19 01:30:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42111 states to 42111 states and 55880 transitions. [2023-12-19 01:30:58,420 INFO L78 Accepts]: Start accepts. Automaton has 42111 states and 55880 transitions. Word has length 146 [2023-12-19 01:30:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:30:58,421 INFO L495 AbstractCegarLoop]: Abstraction has 42111 states and 55880 transitions. [2023-12-19 01:30:58,421 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-19 01:30:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42111 states and 55880 transitions. [2023-12-19 01:30:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:30:58,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:30:58,461 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-19 01:30:58,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 01:30:58,461 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:30:58,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:30:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1363689846, now seen corresponding path program 1 times [2023-12-19 01:30:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:30:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162051748] [2023-12-19 01:30:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:30:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:30:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:30:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:30:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:30:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:30:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:30:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:30:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:30:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:30:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:30:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:30:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:30:58,520 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-19 01:30:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:30:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162051748] [2023-12-19 01:30:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162051748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:30:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:30:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:30:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544379376] [2023-12-19 01:30:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:30:58,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:30:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:30:58,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:30:58,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:30:58,522 INFO L87 Difference]: Start difference. First operand 42111 states and 55880 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-19 01:31:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:00,325 INFO L93 Difference]: Finished difference Result 77045 states and 101997 transitions. [2023-12-19 01:31:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:31:00,326 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-19 01:31:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:00,424 INFO L225 Difference]: With dead ends: 77045 [2023-12-19 01:31:00,424 INFO L226 Difference]: Without dead ends: 34949 [2023-12-19 01:31:00,579 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-19 01:31:00,580 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 287 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 232 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-19 01:31:00,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 232 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:31:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34949 states. [2023-12-19 01:31:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34949 to 32425. [2023-12-19 01:31:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32425 states, 27387 states have (on average 1.3089421988534706) internal successors, (35848), 28024 states have internal predecessors, (35848), 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-19 01:31:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32425 states to 32425 states and 43076 transitions. [2023-12-19 01:31:02,751 INFO L78 Accepts]: Start accepts. Automaton has 32425 states and 43076 transitions. Word has length 146 [2023-12-19 01:31:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:02,751 INFO L495 AbstractCegarLoop]: Abstraction has 32425 states and 43076 transitions. [2023-12-19 01:31:02,751 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-19 01:31:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32425 states and 43076 transitions. [2023-12-19 01:31:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:31:02,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:02,783 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-19 01:31:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 01:31:02,783 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:02,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1773660366, now seen corresponding path program 1 times [2023-12-19 01:31:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958011924] [2023-12-19 01:31:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:31:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:02,924 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-19 01:31:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958011924] [2023-12-19 01:31:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958011924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480449818] [2023-12-19 01:31:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:02,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:02,941 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:02,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-19 01:31:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:03,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:31:03,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:03,130 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-19 01:31:03,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480449818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:03,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:03,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:31:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061149598] [2023-12-19 01:31:03,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:31:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:31:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:03,132 INFO L87 Difference]: Start difference. First operand 32425 states and 43076 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-19 01:31:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:04,872 INFO L93 Difference]: Finished difference Result 55369 states and 75870 transitions. [2023-12-19 01:31:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:31:04,872 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-19 01:31:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:04,992 INFO L225 Difference]: With dead ends: 55369 [2023-12-19 01:31:04,992 INFO L226 Difference]: Without dead ends: 32517 [2023-12-19 01:31:05,032 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-19 01:31:05,033 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 134 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 402 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-19 01:31:05,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 402 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32517 states. [2023-12-19 01:31:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32517 to 32425. [2023-12-19 01:31:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32425 states, 27387 states have (on average 1.2826523533063132) internal successors, (35128), 28024 states have internal predecessors, (35128), 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-19 01:31:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32425 states to 32425 states and 42356 transitions. [2023-12-19 01:31:06,968 INFO L78 Accepts]: Start accepts. Automaton has 32425 states and 42356 transitions. Word has length 150 [2023-12-19 01:31:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:06,970 INFO L495 AbstractCegarLoop]: Abstraction has 32425 states and 42356 transitions. [2023-12-19 01:31:06,970 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-19 01:31:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 32425 states and 42356 transitions. [2023-12-19 01:31:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:31:07,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:07,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, 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-19 01:31:07,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:07,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:07,211 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:07,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash 145282636, now seen corresponding path program 1 times [2023-12-19 01:31:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055149256] [2023-12-19 01:31:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:31:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,359 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-19 01:31:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055149256] [2023-12-19 01:31:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055149256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893841590] [2023-12-19 01:31:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:07,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:07,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:07,361 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:07,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-19 01:31:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:07,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:31:07,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:07,495 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-19 01:31:07,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:07,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893841590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:31:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567480390] [2023-12-19 01:31:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:07,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:31:07,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:31:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:07,498 INFO L87 Difference]: Start difference. First operand 32425 states and 42356 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-19 01:31:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:08,831 INFO L93 Difference]: Finished difference Result 57416 states and 76662 transitions. [2023-12-19 01:31:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:31:08,831 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-19 01:31:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:08,907 INFO L225 Difference]: With dead ends: 57416 [2023-12-19 01:31:08,909 INFO L226 Difference]: Without dead ends: 27310 [2023-12-19 01:31:08,952 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-19 01:31:08,952 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 155 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:08,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 191 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27310 states. [2023-12-19 01:31:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27310 to 26198. [2023-12-19 01:31:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26198 states, 22200 states have (on average 1.2451801801801803) internal successors, (27643), 22694 states have internal predecessors, (27643), 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-19 01:31:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26198 states to 26198 states and 33113 transitions. [2023-12-19 01:31:10,255 INFO L78 Accepts]: Start accepts. Automaton has 26198 states and 33113 transitions. Word has length 150 [2023-12-19 01:31:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:10,255 INFO L495 AbstractCegarLoop]: Abstraction has 26198 states and 33113 transitions. [2023-12-19 01:31:10,255 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-19 01:31:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26198 states and 33113 transitions. [2023-12-19 01:31:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:31:10,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:10,276 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-19 01:31:10,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:10,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:10,484 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:10,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -481573038, now seen corresponding path program 1 times [2023-12-19 01:31:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477402502] [2023-12-19 01:31:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:31:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:31:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,562 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-19 01:31:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477402502] [2023-12-19 01:31:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477402502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563710897] [2023-12-19 01:31:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:10,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:10,563 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:10,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-19 01:31:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:10,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:31:10,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:10,686 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-19 01:31:10,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563710897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:10,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:10,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:31:10,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27509181] [2023-12-19 01:31:10,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:10,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:31:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:31:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:10,688 INFO L87 Difference]: Start difference. First operand 26198 states and 33113 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-19 01:31:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:11,968 INFO L93 Difference]: Finished difference Result 44247 states and 57636 transitions. [2023-12-19 01:31:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:31:11,969 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-19 01:31:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:12,047 INFO L225 Difference]: With dead ends: 44247 [2023-12-19 01:31:12,048 INFO L226 Difference]: Without dead ends: 26268 [2023-12-19 01:31:12,085 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-19 01:31:12,086 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 129 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:12,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 443 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26268 states. [2023-12-19 01:31:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26268 to 26198. [2023-12-19 01:31:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26198 states, 22200 states have (on average 1.215900900900901) internal successors, (26993), 22694 states have internal predecessors, (26993), 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-19 01:31:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26198 states to 26198 states and 32463 transitions. [2023-12-19 01:31:13,536 INFO L78 Accepts]: Start accepts. Automaton has 26198 states and 32463 transitions. Word has length 150 [2023-12-19 01:31:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:13,536 INFO L495 AbstractCegarLoop]: Abstraction has 26198 states and 32463 transitions. [2023-12-19 01:31:13,536 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-19 01:31:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26198 states and 32463 transitions. [2023-12-19 01:31:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:31:13,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:13,554 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-19 01:31:13,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:13,763 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:13,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1396023393, now seen corresponding path program 1 times [2023-12-19 01:31:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239927628] [2023-12-19 01:31:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 01:31:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,852 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-19 01:31:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239927628] [2023-12-19 01:31:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239927628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:13,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727640572] [2023-12-19 01:31:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:13,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:13,855 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-19 01:31:13,878 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-19 01:31:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:13,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:31:13,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:13,982 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-19 01:31:13,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727640572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:31:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054704142] [2023-12-19 01:31:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:13,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:31:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:13,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:31:13,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:13,984 INFO L87 Difference]: Start difference. First operand 26198 states and 32463 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-19 01:31:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:15,399 INFO L93 Difference]: Finished difference Result 39018 states and 49487 transitions. [2023-12-19 01:31:15,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:31:15,400 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-19 01:31:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:15,449 INFO L225 Difference]: With dead ends: 39018 [2023-12-19 01:31:15,449 INFO L226 Difference]: Without dead ends: 26246 [2023-12-19 01:31:15,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:15,466 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 147 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 411 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-19 01:31:15,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 411 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26246 states. [2023-12-19 01:31:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26246 to 26198. [2023-12-19 01:31:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26198 states, 22200 states have (on average 1.2044594594594595) internal successors, (26739), 22694 states have internal predecessors, (26739), 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-19 01:31:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26198 states to 26198 states and 32209 transitions. [2023-12-19 01:31:16,944 INFO L78 Accepts]: Start accepts. Automaton has 26198 states and 32209 transitions. Word has length 151 [2023-12-19 01:31:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:16,945 INFO L495 AbstractCegarLoop]: Abstraction has 26198 states and 32209 transitions. [2023-12-19 01:31:16,946 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-19 01:31:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26198 states and 32209 transitions. [2023-12-19 01:31:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:31:16,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:16,966 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-19 01:31:16,973 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-19 01:31:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:17,177 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:17,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1009794274, now seen corresponding path program 1 times [2023-12-19 01:31:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951071069] [2023-12-19 01:31:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:31:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,266 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-19 01:31:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951071069] [2023-12-19 01:31:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951071069] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274690942] [2023-12-19 01:31:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:17,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:17,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:17,268 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:17,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-19 01:31:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:17,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:31:17,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:17,444 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-19 01:31:17,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274690942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:31:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039065587] [2023-12-19 01:31:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:17,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:31:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:31:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:31:17,447 INFO L87 Difference]: Start difference. First operand 26198 states and 32209 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-19 01:31:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:18,437 INFO L93 Difference]: Finished difference Result 35924 states and 44514 transitions. [2023-12-19 01:31:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:31:18,438 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-19 01:31:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:18,471 INFO L225 Difference]: With dead ends: 35924 [2023-12-19 01:31:18,471 INFO L226 Difference]: Without dead ends: 18853 [2023-12-19 01:31:18,485 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-19 01:31:18,486 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 177 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 259 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-19 01:31:18,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 259 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:31:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states. [2023-12-19 01:31:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 18745. [2023-12-19 01:31:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18745 states, 15907 states have (on average 1.1848871565977244) internal successors, (18848), 16234 states have internal predecessors, (18848), 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-19 01:31:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18745 states to 18745 states and 22688 transitions. [2023-12-19 01:31:19,441 INFO L78 Accepts]: Start accepts. Automaton has 18745 states and 22688 transitions. Word has length 152 [2023-12-19 01:31:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:19,441 INFO L495 AbstractCegarLoop]: Abstraction has 18745 states and 22688 transitions. [2023-12-19 01:31:19,441 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-19 01:31:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18745 states and 22688 transitions. [2023-12-19 01:31:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:31:19,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:19,452 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-19 01:31:19,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-19 01:31:19,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:19,658 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:19,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1481150624, now seen corresponding path program 1 times [2023-12-19 01:31:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270739187] [2023-12-19 01:31:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:31:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,744 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-19 01:31:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270739187] [2023-12-19 01:31:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270739187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241361789] [2023-12-19 01:31:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:19,745 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-19 01:31:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:19,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:31:19,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:19,970 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-19 01:31:19,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241361789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:31:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324055532] [2023-12-19 01:31:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:31:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:31:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:31:19,971 INFO L87 Difference]: Start difference. First operand 18745 states and 22688 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-19 01:31:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:20,742 INFO L93 Difference]: Finished difference Result 28399 states and 34657 transitions. [2023-12-19 01:31:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:31:20,742 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-19 01:31:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:20,772 INFO L225 Difference]: With dead ends: 28399 [2023-12-19 01:31:20,772 INFO L226 Difference]: Without dead ends: 14100 [2023-12-19 01:31:20,788 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-19 01:31:20,788 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 173 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 252 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-19 01:31:20,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 252 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:31:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14100 states. [2023-12-19 01:31:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14100 to 9818. [2023-12-19 01:31:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9818 states, 8351 states have (on average 1.1633337324871273) internal successors, (9715), 8517 states have internal predecessors, (9715), 731 states have call successors, (731), 539 states have call predecessors, (731), 735 states have return successors, (1289), 763 states have call predecessors, (1289), 729 states have call successors, (1289) [2023-12-19 01:31:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9818 states to 9818 states and 11735 transitions. [2023-12-19 01:31:21,294 INFO L78 Accepts]: Start accepts. Automaton has 9818 states and 11735 transitions. Word has length 152 [2023-12-19 01:31:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:21,294 INFO L495 AbstractCegarLoop]: Abstraction has 9818 states and 11735 transitions. [2023-12-19 01:31:21,295 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-19 01:31:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 9818 states and 11735 transitions. [2023-12-19 01:31:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:31:21,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:21,300 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-19 01:31:21,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:21,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-19 01:31:21,504 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:21,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1086671710, now seen corresponding path program 1 times [2023-12-19 01:31:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280420684] [2023-12-19 01:31:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:31:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:31:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,570 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-19 01:31:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280420684] [2023-12-19 01:31:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280420684] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533804636] [2023-12-19 01:31:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:21,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:21,572 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:21,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-19 01:31:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:21,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:31:21,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:21,684 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-19 01:31:21,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533804636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:31:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314619390] [2023-12-19 01:31:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:21,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:31:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:31:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:31:21,686 INFO L87 Difference]: Start difference. First operand 9818 states and 11735 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-19 01:31:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:22,134 INFO L93 Difference]: Finished difference Result 16374 states and 19819 transitions. [2023-12-19 01:31:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:31:22,134 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-19 01:31:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:22,150 INFO L225 Difference]: With dead ends: 16374 [2023-12-19 01:31:22,150 INFO L226 Difference]: Without dead ends: 6566 [2023-12-19 01:31:22,163 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-19 01:31:22,164 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 20 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 454 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2023-12-19 01:31:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 6423. [2023-12-19 01:31:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6423 states, 5422 states have (on average 1.1409074142382885) internal successors, (6186), 5528 states have internal predecessors, (6186), 501 states have call successors, (501), 374 states have call predecessors, (501), 499 states have return successors, (793), 521 states have call predecessors, (793), 499 states have call successors, (793) [2023-12-19 01:31:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 7480 transitions. [2023-12-19 01:31:22,491 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 7480 transitions. Word has length 152 [2023-12-19 01:31:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:22,492 INFO L495 AbstractCegarLoop]: Abstraction has 6423 states and 7480 transitions. [2023-12-19 01:31:22,492 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-19 01:31:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 7480 transitions. [2023-12-19 01:31:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:31:22,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:22,495 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-19 01:31:22,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:22,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-19 01:31:22,702 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:22,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1191881100, now seen corresponding path program 1 times [2023-12-19 01:31:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159363233] [2023-12-19 01:31:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:31:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:31:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,847 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-19 01:31:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159363233] [2023-12-19 01:31:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159363233] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151693191] [2023-12-19 01:31:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:22,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:22,865 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:22,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-19 01:31:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:22,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:31:22,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:23,002 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-19 01:31:23,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151693191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:23,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:31:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981271] [2023-12-19 01:31:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:31:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:31:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:31:23,006 INFO L87 Difference]: Start difference. First operand 6423 states and 7480 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-19 01:31:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:23,375 INFO L93 Difference]: Finished difference Result 11752 states and 13879 transitions. [2023-12-19 01:31:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:31:23,376 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-19 01:31:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:23,386 INFO L225 Difference]: With dead ends: 11752 [2023-12-19 01:31:23,386 INFO L226 Difference]: Without dead ends: 5339 [2023-12-19 01:31:23,395 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-19 01:31:23,397 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:23,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 453 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2023-12-19 01:31:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 5327. [2023-12-19 01:31:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5327 states, 4482 states have (on average 1.1200356983489514) internal successors, (5020), 4563 states have internal predecessors, (5020), 428 states have call successors, (428), 316 states have call predecessors, (428), 416 states have return successors, (617), 448 states have call predecessors, (617), 426 states have call successors, (617) [2023-12-19 01:31:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 6065 transitions. [2023-12-19 01:31:23,668 INFO L78 Accepts]: Start accepts. Automaton has 5327 states and 6065 transitions. Word has length 152 [2023-12-19 01:31:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:23,668 INFO L495 AbstractCegarLoop]: Abstraction has 5327 states and 6065 transitions. [2023-12-19 01:31:23,668 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-19 01:31:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5327 states and 6065 transitions. [2023-12-19 01:31:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:31:23,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:23,671 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-19 01:31:23,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-19 01:31:23,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-19 01:31:23,877 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:23,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 371857010, now seen corresponding path program 1 times [2023-12-19 01:31:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015423472] [2023-12-19 01:31:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:31:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:31:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:31:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:31:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:23,984 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-19 01:31:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015423472] [2023-12-19 01:31:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015423472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:31:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830772331] [2023-12-19 01:31:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:23,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:23,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:31:23,986 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:31:24,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-19 01:31:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:31:24,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:31:24,103 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-19 01:31:24,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:31:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830772331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:31:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:31:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468175563] [2023-12-19 01:31:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:31:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:31:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:31:24,105 INFO L87 Difference]: Start difference. First operand 5327 states and 6065 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-19 01:31:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:24,321 INFO L93 Difference]: Finished difference Result 7964 states and 9097 transitions. [2023-12-19 01:31:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:31:24,322 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-19 01:31:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:24,324 INFO L225 Difference]: With dead ends: 7964 [2023-12-19 01:31:24,324 INFO L226 Difference]: Without dead ends: 1677 [2023-12-19 01:31:24,330 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-19 01:31:24,330 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:24,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:31:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2023-12-19 01:31:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1677. [2023-12-19 01:31:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1410 states have (on average 1.0843971631205673) internal successors, (1529), 1422 states have internal predecessors, (1529), 153 states have call successors, (153), 106 states have call predecessors, (153), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2023-12-19 01:31:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 1841 transitions. [2023-12-19 01:31:24,418 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 1841 transitions. Word has length 152 [2023-12-19 01:31:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:24,418 INFO L495 AbstractCegarLoop]: Abstraction has 1677 states and 1841 transitions. [2023-12-19 01:31:24,418 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-19 01:31:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1841 transitions. [2023-12-19 01:31:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-19 01:31:24,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:24,420 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-19 01:31:24,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-19 01:31:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:31:24,625 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:24,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 778598925, now seen corresponding path program 1 times [2023-12-19 01:31:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317298723] [2023-12-19 01:31:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:31:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:31:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:31:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:31:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:31:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:31:24,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317298723] [2023-12-19 01:31:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317298723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:24,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:31:24,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:31:24,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339384537] [2023-12-19 01:31:24,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:31:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:24,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:31:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:31:24,781 INFO L87 Difference]: Start difference. First operand 1677 states and 1841 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-19 01:31:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:25,476 INFO L93 Difference]: Finished difference Result 1735 states and 1898 transitions. [2023-12-19 01:31:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:31:25,476 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-19 01:31:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:25,480 INFO L225 Difference]: With dead ends: 1735 [2023-12-19 01:31:25,480 INFO L226 Difference]: Without dead ends: 1732 [2023-12-19 01:31:25,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:31:25,480 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 625 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:25,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 658 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:31:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-12-19 01:31:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1676. [2023-12-19 01:31:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1410 states have (on average 1.0829787234042554) internal successors, (1527), 1421 states have internal predecessors, (1527), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2023-12-19 01:31:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 1838 transitions. [2023-12-19 01:31:25,573 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 1838 transitions. Word has length 184 [2023-12-19 01:31:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:25,573 INFO L495 AbstractCegarLoop]: Abstraction has 1676 states and 1838 transitions. [2023-12-19 01:31:25,573 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-19 01:31:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1838 transitions. [2023-12-19 01:31:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-19 01:31:25,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:25,575 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-19 01:31:25,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-19 01:31:25,575 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:25,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -182197899, now seen corresponding path program 1 times [2023-12-19 01:31:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644451398] [2023-12-19 01:31:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:31:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:31:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:31:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:31:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:31:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:31:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:31:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:31:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:31:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:31:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:31:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:31:25,636 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-19 01:31:25,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:31:25,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644451398] [2023-12-19 01:31:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644451398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:31:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:31:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:31:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308296784] [2023-12-19 01:31:25,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:31:25,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:31:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:31:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:31:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:31:25,638 INFO L87 Difference]: Start difference. First operand 1676 states and 1838 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-19 01:31:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:31:25,912 INFO L93 Difference]: Finished difference Result 2405 states and 2628 transitions. [2023-12-19 01:31:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:31:25,913 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-19 01:31:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:31:25,918 INFO L225 Difference]: With dead ends: 2405 [2023-12-19 01:31:25,918 INFO L226 Difference]: Without dead ends: 1742 [2023-12-19 01:31:25,919 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-19 01:31:25,920 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 129 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:31:25,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 288 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:31:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2023-12-19 01:31:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1678. [2023-12-19 01:31:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1412 states have (on average 1.0828611898016998) internal successors, (1529), 1423 states have internal predecessors, (1529), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2023-12-19 01:31:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1840 transitions. [2023-12-19 01:31:26,045 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1840 transitions. Word has length 188 [2023-12-19 01:31:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:31:26,046 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 1840 transitions. [2023-12-19 01:31:26,046 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-19 01:31:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1840 transitions. [2023-12-19 01:31:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-19 01:31:26,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:31:26,047 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-19 01:31:26,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-19 01:31:26,048 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:31:26,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:31:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -124071335, now seen corresponding path program 1 times [2023-12-19 01:31:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:31:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679876666] [2023-12-19 01:31:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:31:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:31:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:31:26,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 01:31:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:31:26,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 01:31:26,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 01:31:26,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:31:26,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:31:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-19 01:31:26,125 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:31:26,133 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:31:26,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:31:26 BoogieIcfgContainer [2023-12-19 01:31:26,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:31:26,278 INFO L158 Benchmark]: Toolchain (without parser) took 81639.77ms. Allocated memory was 230.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 178.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.52ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 160.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 230.7MB. Free memory was 160.5MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: Boogie Preprocessor took 53.32ms. Allocated memory is still 230.7MB. Free memory was 157.9MB in the beginning and 154.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: RCFGBuilder took 595.16ms. Allocated memory is still 230.7MB. Free memory was 154.2MB in the beginning and 121.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-19 01:31:26,278 INFO L158 Benchmark]: TraceAbstraction took 80643.80ms. Allocated memory was 230.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 120.1MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2023-12-19 01:31:26,279 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 191.9MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.52ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 160.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 230.7MB. Free memory was 160.5MB in the beginning and 157.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.32ms. Allocated memory is still 230.7MB. Free memory was 157.9MB in the beginning and 154.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 595.16ms. Allocated memory is still 230.7MB. Free memory was 154.2MB in the beginning and 121.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 80643.80ms. Allocated memory was 230.7MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 120.1MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.4GB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int t2_pc = 0; [L397] int m_st ; [L398] int t1_st ; [L399] int t2_st ; [L400] int m_i ; [L401] int t1_i ; [L402] int t2_i ; [L403] int M_E = 2; [L404] int T1_E = 2; [L405] int T2_E = 2; [L406] int E_M = 2; [L407] int E_1 = 2; [L408] int E_2 = 2; [L413] int token ; [L415] int local ; [L993] COND FALSE !(__VERIFIER_nondet_int()) [L996] CALL main2() [L980] int __retres1 ; [L984] CALL init_model2() [L894] m_i = 1 [L895] t1_i = 1 [L896] t2_i = 1 [L984] RET init_model2() [L985] CALL start_simulation2() [L921] int kernel_st ; [L922] int tmp ; [L923] int tmp___0 ; [L927] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L928] FCALL update_channels2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] CALL init_threads2() [L613] COND TRUE m_i == 1 [L614] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L618] COND TRUE t1_i == 1 [L619] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L623] COND TRUE t2_i == 1 [L624] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] RET init_threads2() [L930] CALL fire_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L726] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L731] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L736] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L741] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L746] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L751] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L930] RET fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L931] CALL activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L567] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L577] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L579] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] CALL, EXPR is_transmit2_triggered() [L583] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L586] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L596] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L598] return (__retres1); [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L931] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] CALL reset_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L764] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L774] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L779] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L784] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L789] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] RET reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND TRUE 1 [L938] kernel_st = 1 [L939] CALL eval2() [L659] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L663] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L633] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] return (__retres1); [L666] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L676] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L673-L684] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE, EXPR \read(tmp_ndt_2) [L692] EXPR t1_st = 1 [L693] CALL, EXPR transmit1() [L476] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L487] COND TRUE 1 [L489] t1_pc = 1 [L490] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L693] RET, EXPR transmit1() [L687-L698] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE, EXPR \read(tmp_ndt_3) [L706] EXPR t2_st = 1 [L707] CALL, EXPR transmit2() [L512] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L523] COND TRUE 1 [L525] t2_pc = 1 [L526] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L707] RET, EXPR transmit2() [L701-L712] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L663] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L633] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] return (__retres1); [L666] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE, EXPR \read(tmp_ndt_1) [L678] EXPR m_st = 1 [L679] CALL, EXPR master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L431] COND TRUE 1 [L434] token = __VERIFIER_nondet_int() [L435] local = token [L436] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L437] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L837] CALL activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L548] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L558] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L560] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L567] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L568] COND TRUE E_1 == 1 [L569] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L579] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] CALL, EXPR is_transmit2_triggered() [L583] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L586] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L587] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L596] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L598] return (__retres1); [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L837] RET activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L437] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L438] E_1 = 2 [L439] m_pc = 1 [L440] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L679] RET, EXPR master() [L673-L684] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE, EXPR \read(tmp_ndt_2) [L692] EXPR t1_st = 1 [L693] CALL, EXPR transmit1() [L476] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L479] COND TRUE t1_pc == 1 [L495] token += 1 [L496] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L497] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L837] CALL activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L548] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L549] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L558] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L560] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L564] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L567] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L568] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L577] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L579] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] CALL, EXPR is_transmit2_triggered() [L583] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L586] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L587] COND TRUE E_2 == 1 [L588] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L598] return (__retres1); [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND TRUE \read(tmp___1) [L824] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L837] RET activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L497] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L498] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L487] COND TRUE 1 [L489] t1_pc = 1 [L490] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L693] RET, EXPR transmit1() [L687-L698] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE, EXPR \read(tmp_ndt_3) [L706] EXPR t2_st = 1 [L707] CALL, EXPR transmit2() [L512] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L515] COND TRUE t2_pc == 1 [L531] token += 1 [L532] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L837] CALL activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L548] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L549] COND TRUE E_M == 1 [L550] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L560] return (__retres1); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L813] CALL, EXPR is_transmit1_triggered() [L564] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L567] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L568] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L577] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L579] return (__retres1); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] CALL, EXPR is_transmit2_triggered() [L583] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L586] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L587] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L596] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L598] return (__retres1); [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L837] RET activate_threads2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L534] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L523] COND TRUE 1 [L525] t2_pc = 1 [L526] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L707] RET, EXPR transmit2() [L701-L712] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L663] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L666] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L633] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L654] return (__retres1); [L666] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L423] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L445] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L450] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L451] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L456] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L457] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L458] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L459] CALL error2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L390] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: 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 11 procedures, 189 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 80.4s, OverallIterations: 42, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10717 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10430 mSDsluCounter, 19955 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11581 mSDsCounter, 1100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12129 IncrementalHoareTripleChecker+Invalid, 13229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1100 mSolverCounterUnsat, 8374 mSDtfsCounter, 12129 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4052 GetRequests, 3774 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48163occurred in iteration=26, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 21007 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 7606 NumberOfCodeBlocks, 7606 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7472 ConstructedInterpolants, 0 QuantifiedInterpolants, 12146 SizeOfPredicates, 5 NumberOfNonLiveVariables, 11020 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 66 InterpolantComputations, 40 PerfectInterpolantSequences, 3430/3970 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-19 01:31:26,294 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...