/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:20:51,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:20:51,800 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-21 11:20:51,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:20:51,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:20:51,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:20:51,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:20:51,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:20:51,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:20:51,818 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:20:51,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:20:51,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:20:51,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:20:51,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:20:51,819 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:20:51,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:20:51,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:20:51,824 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:20:51,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:20:51,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:20:51,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:20:51,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:20:51,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:20:51,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:20:51,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:20:51,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:20:51,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:20:51,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:20:51,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:20:51,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:20:51,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:20:51,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:20:51,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:20:51,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:20:51,829 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:20:51,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:20:51,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:20:51,830 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 -> false [2023-12-21 11:20:52,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:20:52,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:20:52,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:20:52,032 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:20:52,032 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:20:52,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2023-12-21 11:20:53,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:20:53,285 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:20:53,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2023-12-21 11:20:53,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d3f73a5/ecddbce76601485f90d22e3a9eb57cf5/FLAGfe23339fe [2023-12-21 11:20:53,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d3f73a5/ecddbce76601485f90d22e3a9eb57cf5 [2023-12-21 11:20:53,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:20:53,305 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:20:53,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:20:53,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:20:53,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:20:53,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f31ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53, skipping insertion in model container [2023-12-21 11:20:53,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:20:53,421 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2023-12-21 11:20:53,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:20:53,457 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:20:53,464 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2023-12-21 11:20:53,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:20:53,494 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:20:53,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53 WrapperNode [2023-12-21 11:20:53,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:20:53,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:20:53,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:20:53,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:20:53,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,525 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2023-12-21 11:20:53,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:20:53,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:20:53,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:20:53,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:20:53,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,542 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-21 11:20:53,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:20:53,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:20:53,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:20:53,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:20:53,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (1/1) ... [2023-12-21 11:20:53,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:20:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:20:53,583 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-21 11:20:53,584 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-21 11:20:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:20:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 11:20:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 11:20:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 11:20:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 11:20:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-21 11:20:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-21 11:20:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 11:20:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 11:20:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 11:20:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 11:20:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:20:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 11:20:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 11:20:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:20:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:20:53,653 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:20:53,655 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:20:53,901 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:20:53,926 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:20:53,927 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-21 11:20:53,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:20:53 BoogieIcfgContainer [2023-12-21 11:20:53,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:20:53,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:20:53,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:20:53,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:20:53,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:20:53" (1/3) ... [2023-12-21 11:20:53,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f21551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:20:53, skipping insertion in model container [2023-12-21 11:20:53,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:20:53" (2/3) ... [2023-12-21 11:20:53,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f21551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:20:53, skipping insertion in model container [2023-12-21 11:20:53,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:20:53" (3/3) ... [2023-12-21 11:20:53,933 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-12-21 11:20:53,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:20:53,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:20:53,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:20:53,991 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;@5cafccbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:20:53,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:20:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 11:20:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:54,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:54,003 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] [2023-12-21 11:20:54,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:54,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1884876222, now seen corresponding path program 1 times [2023-12-21 11:20:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350611801] [2023-12-21 11:20:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,312 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-21 11:20:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350611801] [2023-12-21 11:20:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350611801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:54,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:20:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011603968] [2023-12-21 11:20:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:54,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:20:54,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:20:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:20:54,345 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:54,767 INFO L93 Difference]: Finished difference Result 248 states and 396 transitions. [2023-12-21 11:20:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:20:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:54,779 INFO L225 Difference]: With dead ends: 248 [2023-12-21 11:20:54,780 INFO L226 Difference]: Without dead ends: 139 [2023-12-21 11:20:54,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:20:54,784 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 252 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:54,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 201 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:20:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-21 11:20:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2023-12-21 11:20:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 90 states have internal predecessors, (133), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 11:20:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-21 11:20:54,821 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 59 [2023-12-21 11:20:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:54,822 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-21 11:20:54,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-21 11:20:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:54,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:54,824 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] [2023-12-21 11:20:54,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:20:54,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:54,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 871751044, now seen corresponding path program 1 times [2023-12-21 11:20:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437912515] [2023-12-21 11:20:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:54,959 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-21 11:20:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437912515] [2023-12-21 11:20:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437912515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:20:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156579376] [2023-12-21 11:20:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:20:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:20:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:20:54,962 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:55,418 INFO L93 Difference]: Finished difference Result 371 states and 562 transitions. [2023-12-21 11:20:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:20:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:55,421 INFO L225 Difference]: With dead ends: 371 [2023-12-21 11:20:55,421 INFO L226 Difference]: Without dead ends: 268 [2023-12-21 11:20:55,422 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-21 11:20:55,423 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 360 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:55,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 328 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:20:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-12-21 11:20:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 213. [2023-12-21 11:20:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 176 states have internal predecessors, (260), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-12-21 11:20:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2023-12-21 11:20:55,442 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 59 [2023-12-21 11:20:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:55,442 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2023-12-21 11:20:55,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2023-12-21 11:20:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:55,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:55,444 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] [2023-12-21 11:20:55,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:20:55,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:55,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash -549214809, now seen corresponding path program 1 times [2023-12-21 11:20:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505274609] [2023-12-21 11:20:55,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:55,539 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-21 11:20:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505274609] [2023-12-21 11:20:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505274609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:55,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:20:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585928980] [2023-12-21 11:20:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:55,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:20:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:20:55,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:20:55,541 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:56,329 INFO L93 Difference]: Finished difference Result 635 states and 942 transitions. [2023-12-21 11:20:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 11:20:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:56,332 INFO L225 Difference]: With dead ends: 635 [2023-12-21 11:20:56,332 INFO L226 Difference]: Without dead ends: 430 [2023-12-21 11:20:56,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:20:56,334 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 374 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:56,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 608 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 11:20:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-21 11:20:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 309. [2023-12-21 11:20:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 253 states have (on average 1.482213438735178) internal successors, (375), 256 states have internal predecessors, (375), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-12-21 11:20:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2023-12-21 11:20:56,370 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 59 [2023-12-21 11:20:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:56,370 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2023-12-21 11:20:56,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2023-12-21 11:20:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:56,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:56,372 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] [2023-12-21 11:20:56,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:20:56,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:56,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1389947237, now seen corresponding path program 1 times [2023-12-21 11:20:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589529640] [2023-12-21 11:20:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:56,492 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-21 11:20:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589529640] [2023-12-21 11:20:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589529640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:20:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096957591] [2023-12-21 11:20:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:56,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:20:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:20:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:20:56,494 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:57,247 INFO L93 Difference]: Finished difference Result 973 states and 1433 transitions. [2023-12-21 11:20:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 11:20:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:57,250 INFO L225 Difference]: With dead ends: 973 [2023-12-21 11:20:57,251 INFO L226 Difference]: Without dead ends: 672 [2023-12-21 11:20:57,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:20:57,252 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 378 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:57,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 606 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 11:20:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-12-21 11:20:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 502. [2023-12-21 11:20:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.470873786407767) internal successors, (606), 417 states have internal predecessors, (606), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-12-21 11:20:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 729 transitions. [2023-12-21 11:20:57,295 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 729 transitions. Word has length 59 [2023-12-21 11:20:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:57,295 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 729 transitions. [2023-12-21 11:20:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 729 transitions. [2023-12-21 11:20:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:57,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:57,297 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] [2023-12-21 11:20:57,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:20:57,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:57,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1036858855, now seen corresponding path program 1 times [2023-12-21 11:20:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602333273] [2023-12-21 11:20:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,381 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-21 11:20:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602333273] [2023-12-21 11:20:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602333273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:20:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637930961] [2023-12-21 11:20:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:57,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:20:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:20:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:20:57,383 INFO L87 Difference]: Start difference. First operand 502 states and 729 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:57,713 INFO L93 Difference]: Finished difference Result 1118 states and 1644 transitions. [2023-12-21 11:20:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:20:57,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:57,716 INFO L225 Difference]: With dead ends: 1118 [2023-12-21 11:20:57,716 INFO L226 Difference]: Without dead ends: 624 [2023-12-21 11:20:57,717 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-21 11:20:57,718 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 278 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:57,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 295 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:20:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-21 11:20:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 502. [2023-12-21 11:20:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.4587378640776698) internal successors, (601), 417 states have internal predecessors, (601), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-12-21 11:20:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2023-12-21 11:20:57,742 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 59 [2023-12-21 11:20:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:57,742 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2023-12-21 11:20:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2023-12-21 11:20:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:57,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:57,744 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] [2023-12-21 11:20:57,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:20:57,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:57,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1930345193, now seen corresponding path program 1 times [2023-12-21 11:20:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:57,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019782262] [2023-12-21 11:20:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:57,829 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-21 11:20:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019782262] [2023-12-21 11:20:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019782262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:20:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943962851] [2023-12-21 11:20:57,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:57,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:20:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:20:57,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:20:57,830 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:58,160 INFO L93 Difference]: Finished difference Result 1091 states and 1601 transitions. [2023-12-21 11:20:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 11:20:58,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:58,163 INFO L225 Difference]: With dead ends: 1091 [2023-12-21 11:20:58,163 INFO L226 Difference]: Without dead ends: 598 [2023-12-21 11:20:58,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:20:58,165 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 158 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:58,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 353 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:20:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-12-21 11:20:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 504. [2023-12-21 11:20:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 414 states have (on average 1.4468599033816425) internal successors, (599), 419 states have internal predecessors, (599), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-12-21 11:20:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 722 transitions. [2023-12-21 11:20:58,187 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 722 transitions. Word has length 59 [2023-12-21 11:20:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:58,187 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 722 transitions. [2023-12-21 11:20:58,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 722 transitions. [2023-12-21 11:20:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:58,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:58,188 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] [2023-12-21 11:20:58,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:20:58,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:58,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1705090581, now seen corresponding path program 1 times [2023-12-21 11:20:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556975526] [2023-12-21 11:20:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,275 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-21 11:20:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:58,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556975526] [2023-12-21 11:20:58,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556975526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:58,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:58,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:20:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860036779] [2023-12-21 11:20:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:58,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:20:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:58,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:20:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:20:58,277 INFO L87 Difference]: Start difference. First operand 504 states and 722 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:58,618 INFO L93 Difference]: Finished difference Result 1113 states and 1625 transitions. [2023-12-21 11:20:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:20:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:58,621 INFO L225 Difference]: With dead ends: 1113 [2023-12-21 11:20:58,621 INFO L226 Difference]: Without dead ends: 618 [2023-12-21 11:20:58,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:20:58,623 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 161 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:58,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 352 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:20:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2023-12-21 11:20:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 514. [2023-12-21 11:20:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 424 states have (on average 1.4363207547169812) internal successors, (609), 429 states have internal predecessors, (609), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-12-21 11:20:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 732 transitions. [2023-12-21 11:20:58,644 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 732 transitions. Word has length 59 [2023-12-21 11:20:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:58,645 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 732 transitions. [2023-12-21 11:20:58,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2023-12-21 11:20:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:20:58,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:58,646 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] [2023-12-21 11:20:58,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:20:58,646 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:58,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1430330967, now seen corresponding path program 1 times [2023-12-21 11:20:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779465060] [2023-12-21 11:20:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:58,747 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-21 11:20:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779465060] [2023-12-21 11:20:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779465060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:20:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914601391] [2023-12-21 11:20:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:20:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:58,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:20:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:20:58,749 INFO L87 Difference]: Start difference. First operand 514 states and 732 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:20:59,573 INFO L93 Difference]: Finished difference Result 2774 states and 4122 transitions. [2023-12-21 11:20:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 11:20:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-21 11:20:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:20:59,581 INFO L225 Difference]: With dead ends: 2774 [2023-12-21 11:20:59,582 INFO L226 Difference]: Without dead ends: 2269 [2023-12-21 11:20:59,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-21 11:20:59,584 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 912 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 11:20:59,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 488 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 11:20:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2023-12-21 11:20:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1449. [2023-12-21 11:20:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1194 states have (on average 1.4288107202680067) internal successors, (1706), 1212 states have internal predecessors, (1706), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2023-12-21 11:20:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2059 transitions. [2023-12-21 11:20:59,645 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2059 transitions. Word has length 59 [2023-12-21 11:20:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:20:59,646 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2059 transitions. [2023-12-21 11:20:59,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:20:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2059 transitions. [2023-12-21 11:20:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 11:20:59,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:20:59,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:20:59,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:20:59,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:20:59,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:20:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1697273882, now seen corresponding path program 1 times [2023-12-21 11:20:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:20:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096895304] [2023-12-21 11:20:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:20:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:20:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:20:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:20:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:20:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:20:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:20:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:20:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:20:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:20:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:20:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096895304] [2023-12-21 11:20:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096895304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:20:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:20:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:20:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966425184] [2023-12-21 11:20:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:20:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:20:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:20:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:20:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:20:59,706 INFO L87 Difference]: Start difference. First operand 1449 states and 2059 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:00,048 INFO L93 Difference]: Finished difference Result 3192 states and 4643 transitions. [2023-12-21 11:21:00,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:21:00,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-12-21 11:21:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:00,055 INFO L225 Difference]: With dead ends: 3192 [2023-12-21 11:21:00,055 INFO L226 Difference]: Without dead ends: 1752 [2023-12-21 11:21:00,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:21:00,060 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 146 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:00,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 347 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:21:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2023-12-21 11:21:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1469. [2023-12-21 11:21:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1214 states have (on average 1.4176276771004943) internal successors, (1721), 1232 states have internal predecessors, (1721), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2023-12-21 11:21:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2074 transitions. [2023-12-21 11:21:00,122 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2074 transitions. Word has length 75 [2023-12-21 11:21:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2074 transitions. [2023-12-21 11:21:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2074 transitions. [2023-12-21 11:21:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 11:21:00,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:00,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:00,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:21:00,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:00,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash 799880604, now seen corresponding path program 1 times [2023-12-21 11:21:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122094107] [2023-12-21 11:21:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:21:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:21:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122094107] [2023-12-21 11:21:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122094107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:21:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243113583] [2023-12-21 11:21:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:00,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:21:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:21:00,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:21:00,272 INFO L87 Difference]: Start difference. First operand 1469 states and 2074 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:00,960 INFO L93 Difference]: Finished difference Result 2415 states and 3424 transitions. [2023-12-21 11:21:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 11:21:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-12-21 11:21:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:00,965 INFO L225 Difference]: With dead ends: 2415 [2023-12-21 11:21:00,965 INFO L226 Difference]: Without dead ends: 1508 [2023-12-21 11:21:00,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:21:00,967 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 500 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:00,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 452 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 11:21:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2023-12-21 11:21:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1163. [2023-12-21 11:21:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 961 states have (on average 1.4079084287200831) internal successors, (1353), 972 states have internal predecessors, (1353), 123 states have call successors, (123), 72 states have call predecessors, (123), 78 states have return successors, (146), 120 states have call predecessors, (146), 123 states have call successors, (146) [2023-12-21 11:21:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1622 transitions. [2023-12-21 11:21:01,012 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1622 transitions. Word has length 75 [2023-12-21 11:21:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:01,012 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1622 transitions. [2023-12-21 11:21:01,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1622 transitions. [2023-12-21 11:21:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 11:21:01,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:01,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:21:01,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:01,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -229478694, now seen corresponding path program 1 times [2023-12-21 11:21:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953661956] [2023-12-21 11:21:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:21:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:21:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953661956] [2023-12-21 11:21:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953661956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:21:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953656914] [2023-12-21 11:21:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:01,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:21:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:21:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:21:01,109 INFO L87 Difference]: Start difference. First operand 1163 states and 1622 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:01,770 INFO L93 Difference]: Finished difference Result 2049 states and 2886 transitions. [2023-12-21 11:21:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 11:21:01,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-12-21 11:21:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:01,775 INFO L225 Difference]: With dead ends: 2049 [2023-12-21 11:21:01,775 INFO L226 Difference]: Without dead ends: 1166 [2023-12-21 11:21:01,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:21:01,777 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 597 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:01,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 398 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:21:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-12-21 11:21:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 881. [2023-12-21 11:21:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 729 states have (on average 1.412894375857339) internal successors, (1030), 736 states have internal predecessors, (1030), 94 states have call successors, (94), 54 states have call predecessors, (94), 57 states have return successors, (107), 91 states have call predecessors, (107), 94 states have call successors, (107) [2023-12-21 11:21:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1231 transitions. [2023-12-21 11:21:01,816 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1231 transitions. Word has length 75 [2023-12-21 11:21:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1231 transitions. [2023-12-21 11:21:01,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1231 transitions. [2023-12-21 11:21:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 11:21:01,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:01,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:01,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:21:01,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:01,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 430052828, now seen corresponding path program 1 times [2023-12-21 11:21:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668935682] [2023-12-21 11:21:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:21:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 11:21:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668935682] [2023-12-21 11:21:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668935682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:21:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022092710] [2023-12-21 11:21:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:01,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:21:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:21:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:01,893 INFO L87 Difference]: Start difference. First operand 881 states and 1231 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:02,197 INFO L93 Difference]: Finished difference Result 2304 states and 3200 transitions. [2023-12-21 11:21:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:21:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-12-21 11:21:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:02,202 INFO L225 Difference]: With dead ends: 2304 [2023-12-21 11:21:02,202 INFO L226 Difference]: Without dead ends: 1433 [2023-12-21 11:21:02,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:21:02,205 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 490 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:02,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 251 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:21:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2023-12-21 11:21:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1090. [2023-12-21 11:21:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 917 states have (on average 1.3500545256270446) internal successors, (1238), 924 states have internal predecessors, (1238), 100 states have call successors, (100), 69 states have call predecessors, (100), 72 states have return successors, (128), 97 states have call predecessors, (128), 100 states have call successors, (128) [2023-12-21 11:21:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1466 transitions. [2023-12-21 11:21:02,276 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1466 transitions. Word has length 75 [2023-12-21 11:21:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:02,276 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1466 transitions. [2023-12-21 11:21:02,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:21:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1466 transitions. [2023-12-21 11:21:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 11:21:02,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:02,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:02,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:21:02,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:02,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash -413952674, now seen corresponding path program 1 times [2023-12-21 11:21:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075458825] [2023-12-21 11:21:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:21:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 11:21:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075458825] [2023-12-21 11:21:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075458825] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169406611] [2023-12-21 11:21:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:02,384 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-21 11:21:02,389 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-21 11:21:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:21:02,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:21:02,490 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169406611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:02,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-21 11:21:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151922004] [2023-12-21 11:21:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:02,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:02,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:02,491 INFO L87 Difference]: Start difference. First operand 1090 states and 1466 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 11:21:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:02,577 INFO L93 Difference]: Finished difference Result 2526 states and 3457 transitions. [2023-12-21 11:21:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2023-12-21 11:21:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:02,582 INFO L225 Difference]: With dead ends: 2526 [2023-12-21 11:21:02,582 INFO L226 Difference]: Without dead ends: 1792 [2023-12-21 11:21:02,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:02,584 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 121 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:02,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-12-21 11:21:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2023-12-21 11:21:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1510 states have (on average 1.343046357615894) internal successors, (2028), 1519 states have internal predecessors, (2028), 162 states have call successors, (162), 114 states have call predecessors, (162), 119 states have return successors, (235), 159 states have call predecessors, (235), 162 states have call successors, (235) [2023-12-21 11:21:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2425 transitions. [2023-12-21 11:21:02,642 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2425 transitions. Word has length 75 [2023-12-21 11:21:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:02,642 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2425 transitions. [2023-12-21 11:21:02,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 11:21:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2425 transitions. [2023-12-21 11:21:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-21 11:21:02,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:02,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:02,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 11:21:02,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 11:21:02,849 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:02,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1163334948, now seen corresponding path program 1 times [2023-12-21 11:21:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836963877] [2023-12-21 11:21:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:21:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:21:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836963877] [2023-12-21 11:21:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836963877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:02,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:21:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119282864] [2023-12-21 11:21:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:03,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:21:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:21:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:03,001 INFO L87 Difference]: Start difference. First operand 1792 states and 2425 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:21:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:03,491 INFO L93 Difference]: Finished difference Result 5580 states and 7620 transitions. [2023-12-21 11:21:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:21:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2023-12-21 11:21:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:03,503 INFO L225 Difference]: With dead ends: 5580 [2023-12-21 11:21:03,503 INFO L226 Difference]: Without dead ends: 3798 [2023-12-21 11:21:03,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-12-21 11:21:03,507 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 474 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:03,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 377 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:21:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2023-12-21 11:21:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3318. [2023-12-21 11:21:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2779 states have (on average 1.327455919395466) internal successors, (3689), 2819 states have internal predecessors, (3689), 293 states have call successors, (293), 198 states have call predecessors, (293), 245 states have return successors, (522), 302 states have call predecessors, (522), 293 states have call successors, (522) [2023-12-21 11:21:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4504 transitions. [2023-12-21 11:21:03,680 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4504 transitions. Word has length 87 [2023-12-21 11:21:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:03,681 INFO L495 AbstractCegarLoop]: Abstraction has 3318 states and 4504 transitions. [2023-12-21 11:21:03,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:21:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4504 transitions. [2023-12-21 11:21:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-21 11:21:03,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:03,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:03,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:21:03,682 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:03,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2073794270, now seen corresponding path program 1 times [2023-12-21 11:21:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803829574] [2023-12-21 11:21:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:21:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:21:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803829574] [2023-12-21 11:21:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803829574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:21:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574911028] [2023-12-21 11:21:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:03,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:21:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:21:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:21:03,722 INFO L87 Difference]: Start difference. First operand 3318 states and 4504 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:21:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:03,972 INFO L93 Difference]: Finished difference Result 7151 states and 9670 transitions. [2023-12-21 11:21:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:21:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2023-12-21 11:21:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:03,984 INFO L225 Difference]: With dead ends: 7151 [2023-12-21 11:21:03,985 INFO L226 Difference]: Without dead ends: 3842 [2023-12-21 11:21:03,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-21 11:21:03,991 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 313 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:03,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 186 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:21:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2023-12-21 11:21:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3313. [2023-12-21 11:21:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2777 states have (on average 1.3273316528628016) internal successors, (3686), 2816 states have internal predecessors, (3686), 290 states have call successors, (290), 198 states have call predecessors, (290), 245 states have return successors, (518), 299 states have call predecessors, (518), 290 states have call successors, (518) [2023-12-21 11:21:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4494 transitions. [2023-12-21 11:21:04,141 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4494 transitions. Word has length 87 [2023-12-21 11:21:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:04,141 INFO L495 AbstractCegarLoop]: Abstraction has 3313 states and 4494 transitions. [2023-12-21 11:21:04,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:21:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4494 transitions. [2023-12-21 11:21:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-21 11:21:04,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:04,142 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 11:21:04,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:21:04,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:04,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash 696510049, now seen corresponding path program 1 times [2023-12-21 11:21:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:04,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865645295] [2023-12-21 11:21:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:21:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 11:21:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865645295] [2023-12-21 11:21:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865645295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:21:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063524670] [2023-12-21 11:21:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:21:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:21:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:21:04,210 INFO L87 Difference]: Start difference. First operand 3313 states and 4494 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:21:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:04,612 INFO L93 Difference]: Finished difference Result 8011 states and 10966 transitions. [2023-12-21 11:21:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:21:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2023-12-21 11:21:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:04,636 INFO L225 Difference]: With dead ends: 8011 [2023-12-21 11:21:04,636 INFO L226 Difference]: Without dead ends: 5328 [2023-12-21 11:21:04,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:21:04,643 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 404 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:04,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 247 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:21:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2023-12-21 11:21:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4538. [2023-12-21 11:21:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 3799 states have (on average 1.3227165043432483) internal successors, (5025), 3848 states have internal predecessors, (5025), 402 states have call successors, (402), 276 states have call predecessors, (402), 336 states have return successors, (684), 414 states have call predecessors, (684), 402 states have call successors, (684) [2023-12-21 11:21:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 6111 transitions. [2023-12-21 11:21:04,853 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 6111 transitions. Word has length 89 [2023-12-21 11:21:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:04,854 INFO L495 AbstractCegarLoop]: Abstraction has 4538 states and 6111 transitions. [2023-12-21 11:21:04,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:21:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 6111 transitions. [2023-12-21 11:21:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 11:21:04,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:04,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:04,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 11:21:04,857 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:04,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash -216901673, now seen corresponding path program 1 times [2023-12-21 11:21:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306718789] [2023-12-21 11:21:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 11:21:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:21:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 11:21:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306718789] [2023-12-21 11:21:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306718789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6792459] [2023-12-21 11:21:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:04,945 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-21 11:21:04,951 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-21 11:21:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:21:05,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 11:21:05,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6792459] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:05,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:05,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-21 11:21:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561998975] [2023-12-21 11:21:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:05,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:05,089 INFO L87 Difference]: Start difference. First operand 4538 states and 6111 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:21:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:05,311 INFO L93 Difference]: Finished difference Result 10339 states and 13915 transitions. [2023-12-21 11:21:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2023-12-21 11:21:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:05,330 INFO L225 Difference]: With dead ends: 10339 [2023-12-21 11:21:05,331 INFO L226 Difference]: Without dead ends: 5810 [2023-12-21 11:21:05,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:05,339 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:05,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 315 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2023-12-21 11:21:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5789. [2023-12-21 11:21:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 4833 states have (on average 1.3167804676184565) internal successors, (6364), 4890 states have internal predecessors, (6364), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (825), 539 states have call predecessors, (825), 530 states have call successors, (825) [2023-12-21 11:21:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7719 transitions. [2023-12-21 11:21:05,566 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7719 transitions. Word has length 105 [2023-12-21 11:21:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:05,567 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 7719 transitions. [2023-12-21 11:21:05,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:21:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7719 transitions. [2023-12-21 11:21:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 11:21:05,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:05,569 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, 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-21 11:21:05,582 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-21 11:21:05,774 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,SelfDestructingSolverStorable16 [2023-12-21 11:21:05,774 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:05,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1504373732, now seen corresponding path program 1 times [2023-12-21 11:21:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125859375] [2023-12-21 11:21:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 11:21:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:21:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 11:21:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125859375] [2023-12-21 11:21:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125859375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621073968] [2023-12-21 11:21:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:05,861 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-21 11:21:05,863 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-21 11:21:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:05,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:21:05,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:21:05,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621073968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:05,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:05,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-21 11:21:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031476368] [2023-12-21 11:21:05,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:05,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:05,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:05,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:05,960 INFO L87 Difference]: Start difference. First operand 5789 states and 7719 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:21:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:06,131 INFO L93 Difference]: Finished difference Result 10396 states and 13874 transitions. [2023-12-21 11:21:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 108 [2023-12-21 11:21:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:06,143 INFO L225 Difference]: With dead ends: 10396 [2023-12-21 11:21:06,144 INFO L226 Difference]: Without dead ends: 5868 [2023-12-21 11:21:06,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:21:06,152 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 112 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:06,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2023-12-21 11:21:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 5778. [2023-12-21 11:21:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 4822 states have (on average 1.3079635006221484) internal successors, (6307), 4879 states have internal predecessors, (6307), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (730), 539 states have call predecessors, (730), 530 states have call successors, (730) [2023-12-21 11:21:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 7567 transitions. [2023-12-21 11:21:06,402 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 7567 transitions. Word has length 108 [2023-12-21 11:21:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:06,402 INFO L495 AbstractCegarLoop]: Abstraction has 5778 states and 7567 transitions. [2023-12-21 11:21:06,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:21:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 7567 transitions. [2023-12-21 11:21:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 11:21:06,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:06,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:06,418 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-21 11:21:06,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 11:21:06,610 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:06,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1790084883, now seen corresponding path program 1 times [2023-12-21 11:21:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131765643] [2023-12-21 11:21:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 11:21:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 11:21:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 11:21:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 11:21:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131765643] [2023-12-21 11:21:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131765643] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194412921] [2023-12-21 11:21:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:06,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:06,684 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-21 11:21:06,740 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-21 11:21:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:06,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:21:06,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-21 11:21:06,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194412921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-21 11:21:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732522035] [2023-12-21 11:21:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:06,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:21:06,807 INFO L87 Difference]: Start difference. First operand 5778 states and 7567 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 11:21:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:07,156 INFO L93 Difference]: Finished difference Result 16773 states and 22299 transitions. [2023-12-21 11:21:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:07,157 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 136 [2023-12-21 11:21:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:07,183 INFO L225 Difference]: With dead ends: 16773 [2023-12-21 11:21:07,183 INFO L226 Difference]: Without dead ends: 11005 [2023-12-21 11:21:07,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:21:07,196 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 139 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:07,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11005 states. [2023-12-21 11:21:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11005 to 10991. [2023-12-21 11:21:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10991 states, 9193 states have (on average 1.2933753943217665) internal successors, (11890), 9297 states have internal predecessors, (11890), 993 states have call successors, (993), 687 states have call predecessors, (993), 804 states have return successors, (1560), 1008 states have call predecessors, (1560), 993 states have call successors, (1560) [2023-12-21 11:21:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10991 states to 10991 states and 14443 transitions. [2023-12-21 11:21:07,726 INFO L78 Accepts]: Start accepts. Automaton has 10991 states and 14443 transitions. Word has length 136 [2023-12-21 11:21:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:07,726 INFO L495 AbstractCegarLoop]: Abstraction has 10991 states and 14443 transitions. [2023-12-21 11:21:07,727 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 11:21:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 10991 states and 14443 transitions. [2023-12-21 11:21:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 11:21:07,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:07,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:07,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 11:21:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:07,937 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:07,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1254459883, now seen corresponding path program 1 times [2023-12-21 11:21:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032005680] [2023-12-21 11:21:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 11:21:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:21:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 11:21:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-21 11:21:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032005680] [2023-12-21 11:21:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032005680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:07,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:21:07,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101025602] [2023-12-21 11:21:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:07,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:21:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:21:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:21:07,988 INFO L87 Difference]: Start difference. First operand 10991 states and 14443 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:21:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:08,534 INFO L93 Difference]: Finished difference Result 23035 states and 30162 transitions. [2023-12-21 11:21:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:21:08,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 137 [2023-12-21 11:21:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:08,561 INFO L225 Difference]: With dead ends: 23035 [2023-12-21 11:21:08,561 INFO L226 Difference]: Without dead ends: 12054 [2023-12-21 11:21:08,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-21 11:21:08,581 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 313 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:08,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 183 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:21:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2023-12-21 11:21:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 10559. [2023-12-21 11:21:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10559 states, 8869 states have (on average 1.2886458450783629) internal successors, (11429), 8979 states have internal predecessors, (11429), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2023-12-21 11:21:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10559 states to 10559 states and 13818 transitions. [2023-12-21 11:21:09,139 INFO L78 Accepts]: Start accepts. Automaton has 10559 states and 13818 transitions. Word has length 137 [2023-12-21 11:21:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:09,139 INFO L495 AbstractCegarLoop]: Abstraction has 10559 states and 13818 transitions. [2023-12-21 11:21:09,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-21 11:21:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10559 states and 13818 transitions. [2023-12-21 11:21:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 11:21:09,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:09,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-21 11:21:09,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 11:21:09,144 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:09,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1267645569, now seen corresponding path program 1 times [2023-12-21 11:21:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534069536] [2023-12-21 11:21:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:21:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 11:21:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-21 11:21:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-21 11:21:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534069536] [2023-12-21 11:21:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534069536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930815107] [2023-12-21 11:21:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:09,202 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-21 11:21:09,205 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-21 11:21:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:09,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:21:09,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 11:21:09,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930815107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-21 11:21:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65880101] [2023-12-21 11:21:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:21:09,303 INFO L87 Difference]: Start difference. First operand 10559 states and 13818 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-21 11:21:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:09,647 INFO L93 Difference]: Finished difference Result 16629 states and 22261 transitions. [2023-12-21 11:21:09,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:09,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 138 [2023-12-21 11:21:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:09,673 INFO L225 Difference]: With dead ends: 16629 [2023-12-21 11:21:09,673 INFO L226 Difference]: Without dead ends: 10523 [2023-12-21 11:21:09,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 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-21 11:21:09,684 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 394 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-21 11:21:09,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 394 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2023-12-21 11:21:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10477. [2023-12-21 11:21:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10477 states, 8787 states have (on average 1.2700580402867874) internal successors, (11160), 8897 states have internal predecessors, (11160), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2023-12-21 11:21:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 13549 transitions. [2023-12-21 11:21:10,181 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 13549 transitions. Word has length 138 [2023-12-21 11:21:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:10,181 INFO L495 AbstractCegarLoop]: Abstraction has 10477 states and 13549 transitions. [2023-12-21 11:21:10,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-21 11:21:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 13549 transitions. [2023-12-21 11:21:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 11:21:10,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:10,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-21 11:21:10,206 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-21 11:21:10,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:10,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:10,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -942763104, now seen corresponding path program 1 times [2023-12-21 11:21:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759592812] [2023-12-21 11:21:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:21:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 11:21:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-21 11:21:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 11:21:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759592812] [2023-12-21 11:21:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759592812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:10,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:21:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031677221] [2023-12-21 11:21:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:10,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:21:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:21:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:21:10,465 INFO L87 Difference]: Start difference. First operand 10477 states and 13549 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:21:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:11,191 INFO L93 Difference]: Finished difference Result 18286 states and 23578 transitions. [2023-12-21 11:21:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:21:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 139 [2023-12-21 11:21:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:11,209 INFO L225 Difference]: With dead ends: 18286 [2023-12-21 11:21:11,209 INFO L226 Difference]: Without dead ends: 8860 [2023-12-21 11:21:11,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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-21 11:21:11,219 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:11,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 414 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:21:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2023-12-21 11:21:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 7787. [2023-12-21 11:21:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2438543247344462) internal successors, (8197), 6671 states have internal predecessors, (8197), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2023-12-21 11:21:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9723 transitions. [2023-12-21 11:21:11,486 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9723 transitions. Word has length 139 [2023-12-21 11:21:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:11,486 INFO L495 AbstractCegarLoop]: Abstraction has 7787 states and 9723 transitions. [2023-12-21 11:21:11,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:21:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9723 transitions. [2023-12-21 11:21:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 11:21:11,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:11,490 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, 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] [2023-12-21 11:21:11,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:21:11,490 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:11,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash -860840103, now seen corresponding path program 1 times [2023-12-21 11:21:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:11,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855421874] [2023-12-21 11:21:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:21:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 11:21:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-21 11:21:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-21 11:21:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855421874] [2023-12-21 11:21:11,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855421874] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:21:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355830584] [2023-12-21 11:21:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:21:11,577 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-21 11:21:11,578 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-21 11:21:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:11,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:21:11,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:21:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 11:21:11,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:21:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355830584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:11,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:21:11,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-21 11:21:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091590760] [2023-12-21 11:21:11,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:11,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:21:11,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:11,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:21:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:21:11,711 INFO L87 Difference]: Start difference. First operand 7787 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-21 11:21:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:11,977 INFO L93 Difference]: Finished difference Result 13995 states and 17731 transitions. [2023-12-21 11:21:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:21:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 140 [2023-12-21 11:21:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:11,994 INFO L225 Difference]: With dead ends: 13995 [2023-12-21 11:21:11,994 INFO L226 Difference]: Without dead ends: 7805 [2023-12-21 11:21:12,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 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-21 11:21:12,004 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:12,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 333 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:21:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2023-12-21 11:21:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7787. [2023-12-21 11:21:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2192716236722307) internal successors, (8035), 6671 states have internal predecessors, (8035), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2023-12-21 11:21:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9561 transitions. [2023-12-21 11:21:12,337 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9561 transitions. Word has length 140 [2023-12-21 11:21:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:12,337 INFO L495 AbstractCegarLoop]: Abstraction has 7787 states and 9561 transitions. [2023-12-21 11:21:12,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-21 11:21:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9561 transitions. [2023-12-21 11:21:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 11:21:12,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:12,341 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, 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] [2023-12-21 11:21:12,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 11:21:12,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:21:12,546 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:12,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash 941490296, now seen corresponding path program 2 times [2023-12-21 11:21:12,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:12,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627003653] [2023-12-21 11:21:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:21:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:21:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:21:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:21:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:21:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 11:21:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 11:21:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-21 11:21:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-21 11:21:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:21:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-21 11:21:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:21:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627003653] [2023-12-21 11:21:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627003653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:21:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:21:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:21:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667906073] [2023-12-21 11:21:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:21:12,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:21:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:21:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:21:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:21:12,667 INFO L87 Difference]: Start difference. First operand 7787 states and 9561 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-21 11:21:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:21:13,572 INFO L93 Difference]: Finished difference Result 18571 states and 23383 transitions. [2023-12-21 11:21:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 11:21:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 140 [2023-12-21 11:21:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:21:13,595 INFO L225 Difference]: With dead ends: 18571 [2023-12-21 11:21:13,595 INFO L226 Difference]: Without dead ends: 10794 [2023-12-21 11:21:13,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2023-12-21 11:21:13,609 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1060 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:21:13,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 293 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:21:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2023-12-21 11:21:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 9967. [2023-12-21 11:21:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9967 states, 8400 states have (on average 1.1648809523809525) internal successors, (9785), 8561 states have internal predecessors, (9785), 780 states have call successors, (780), 606 states have call predecessors, (780), 786 states have return successors, (1167), 800 states have call predecessors, (1167), 780 states have call successors, (1167) [2023-12-21 11:21:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9967 states to 9967 states and 11732 transitions. [2023-12-21 11:21:14,030 INFO L78 Accepts]: Start accepts. Automaton has 9967 states and 11732 transitions. Word has length 140 [2023-12-21 11:21:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:21:14,031 INFO L495 AbstractCegarLoop]: Abstraction has 9967 states and 11732 transitions. [2023-12-21 11:21:14,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-21 11:21:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 9967 states and 11732 transitions. [2023-12-21 11:21:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-21 11:21:14,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:21:14,036 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, 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] [2023-12-21 11:21:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 11:21:14,037 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:21:14,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:21:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 593334297, now seen corresponding path program 1 times [2023-12-21 11:21:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:21:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600050596] [2023-12-21 11:21:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:21:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:21:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:21:14,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 11:21:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:21:14,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 11:21:14,082 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 11:21:14,083 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:21:14,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 11:21:14,088 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:21:14,091 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:21:14,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:21:14 BoogieIcfgContainer [2023-12-21 11:21:14,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:21:14,186 INFO L158 Benchmark]: Toolchain (without parser) took 20881.46ms. Allocated memory was 194.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 139.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 99.0MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,186 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:21:14,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.10ms. Allocated memory is still 194.0MB. Free memory was 139.5MB in the beginning and 125.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.83ms. Allocated memory is still 194.0MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,187 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 194.0MB. Free memory was 123.2MB in the beginning and 120.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,187 INFO L158 Benchmark]: RCFGBuilder took 372.82ms. Allocated memory is still 194.0MB. Free memory was 120.6MB in the beginning and 98.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,187 INFO L158 Benchmark]: TraceAbstraction took 20256.94ms. Allocated memory was 194.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 97.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. [2023-12-21 11:21:14,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.10ms. Allocated memory is still 194.0MB. Free memory was 139.5MB in the beginning and 125.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.83ms. Allocated memory is still 194.0MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 194.0MB. Free memory was 123.2MB in the beginning and 120.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.82ms. Allocated memory is still 194.0MB. Free memory was 120.6MB in the beginning and 98.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 20256.94ms. Allocated memory was 194.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 97.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 57.0MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L281-L292] { 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, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET, EXPR transmit1() [L295-L306] { 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, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE, EXPR \read(tmp_ndt_3) [L314] EXPR t2_st = 1 [L315] CALL, EXPR transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET, EXPR transmit2() [L309-L320] { 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, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE, EXPR \read(tmp_ndt_1) [L286] EXPR m_st = 1 [L287] CALL, EXPR master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET, EXPR master() [L281-L292] { 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, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET, EXPR transmit1() [L295-L306] { 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, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8547 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8347 mSDsluCounter, 8432 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5297 mSDsCounter, 1243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9850 IncrementalHoareTripleChecker+Invalid, 11093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1243 mSolverCounterUnsat, 3135 mSDtfsCounter, 9850 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1340 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10991occurred in iteration=19, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 8153 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2996 NumberOfCodeBlocks, 2996 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2825 ConstructedInterpolants, 0 QuantifiedInterpolants, 5717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2257 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 802/887 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-21 11:21:14,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...