/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/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:11:15,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:11:15,367 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:11:15,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:11:15,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:11:15,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:11:15,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:11:15,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:11:15,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:11:15,388 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:11:15,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:11:15,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:11:15,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:11:15,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:11:15,389 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:11:15,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:11:15,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:11:15,390 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:11:15,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:11:15,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:11:15,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:11:15,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:11:15,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:11:15,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:11:15,392 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:11:15,392 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:11:15,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:11:15,392 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:11:15,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:11:15,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:11:15,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:11:15,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:11:15,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:15,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:11:15,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:11:15,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:11:15,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:11:15,395 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:11:15,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:11:15,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:11:15,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:11:15,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:11:15,546 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:11:15,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2023-12-21 11:11:16,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:11:16,755 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:11:16,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2023-12-21 11:11:16,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99237970/e46368ec22844dedb5f5104bfb2f8e8a/FLAG413801560 [2023-12-21 11:11:17,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99237970/e46368ec22844dedb5f5104bfb2f8e8a [2023-12-21 11:11:17,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:11:17,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:11:17,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:17,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:11:17,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:11:17,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b06d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17, skipping insertion in model container [2023-12-21 11:11:17,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,183 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:11:17,296 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/kundu1.cil.c[636,649] [2023-12-21 11:11:17,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:17,336 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:11:17,343 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/kundu1.cil.c[636,649] [2023-12-21 11:11:17,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:11:17,371 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:11:17,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17 WrapperNode [2023-12-21 11:11:17,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:11:17,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:17,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:11:17,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:11:17,377 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:11:17" (1/1) ... [2023-12-21 11:11:17,382 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:11:17" (1/1) ... [2023-12-21 11:11:17,399 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2023-12-21 11:11:17,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:11:17,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:11:17,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:11:17,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:11:17,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,423 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:11:17,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:11:17,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:11:17,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:11:17,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:11:17,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (1/1) ... [2023-12-21 11:11:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:11:17,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:17,492 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:11:17,515 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:11:17,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:11:17,521 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 11:11:17,522 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 11:11:17,522 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 11:11:17,522 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 11:11:17,522 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 11:11:17,523 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 11:11:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 11:11:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 11:11:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 11:11:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 11:11:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:11:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 11:11:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 11:11:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:11:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:11:17,617 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:11:17,619 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:11:17,856 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:11:17,892 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:11:17,892 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 11:11:17,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:17 BoogieIcfgContainer [2023-12-21 11:11:17,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:11:17,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:11:17,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:11:17,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:11:17,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:11:17" (1/3) ... [2023-12-21 11:11:17,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c82364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:17, skipping insertion in model container [2023-12-21 11:11:17,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:11:17" (2/3) ... [2023-12-21 11:11:17,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c82364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:11:17, skipping insertion in model container [2023-12-21 11:11:17,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:11:17" (3/3) ... [2023-12-21 11:11:17,898 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-12-21 11:11:17,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:11:17,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:11:17,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:11:17,949 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;@2fc4ca68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:11:17,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:11:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 76 states have internal predecessors, (114), 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:11:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 11:11:17,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:17,959 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] [2023-12-21 11:11:17,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:17,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 351875085, now seen corresponding path program 1 times [2023-12-21 11:11:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75640869] [2023-12-21 11:11:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:17,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 11:11:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 11:11:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,245 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:11:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75640869] [2023-12-21 11:11:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75640869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:18,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897763538] [2023-12-21 11:11:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:18,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:18,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:18,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:18,272 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 76 states have internal predecessors, (114), 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 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:18,480 INFO L93 Difference]: Finished difference Result 282 states and 434 transitions. [2023-12-21 11:11:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:11:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-21 11:11:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:18,489 INFO L225 Difference]: With dead ends: 282 [2023-12-21 11:11:18,489 INFO L226 Difference]: Without dead ends: 191 [2023-12-21 11:11:18,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:18,493 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 271 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:18,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 532 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-21 11:11:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2023-12-21 11:11:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 132 states have internal predecessors, (188), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 11:11:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2023-12-21 11:11:18,529 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 44 [2023-12-21 11:11:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2023-12-21 11:11:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2023-12-21 11:11:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 11:11:18,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:18,531 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] [2023-12-21 11:11:18,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:11:18,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:18,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1419595890, now seen corresponding path program 1 times [2023-12-21 11:11:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:18,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377595664] [2023-12-21 11:11:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 11:11:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 11:11:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,616 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:11:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377595664] [2023-12-21 11:11:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377595664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170795043] [2023-12-21 11:11:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:18,618 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:18,717 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2023-12-21 11:11:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:11:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-21 11:11:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:18,719 INFO L225 Difference]: With dead ends: 334 [2023-12-21 11:11:18,719 INFO L226 Difference]: Without dead ends: 179 [2023-12-21 11:11:18,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:18,721 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 48 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:18,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 398 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-21 11:11:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2023-12-21 11:11:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 134 states have internal predecessors, (189), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 11:11:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 232 transitions. [2023-12-21 11:11:18,734 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 232 transitions. Word has length 44 [2023-12-21 11:11:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:18,734 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 232 transitions. [2023-12-21 11:11:18,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 232 transitions. [2023-12-21 11:11:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 11:11:18,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:18,735 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] [2023-12-21 11:11:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:11:18,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:18,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1929068980, now seen corresponding path program 1 times [2023-12-21 11:11:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:18,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925875133] [2023-12-21 11:11:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 11:11:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 11:11:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:18,831 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:11:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925875133] [2023-12-21 11:11:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925875133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:11:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655538345] [2023-12-21 11:11:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:18,833 INFO L87 Difference]: Start difference. First operand 165 states and 232 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:19,186 INFO L93 Difference]: Finished difference Result 653 states and 933 transitions. [2023-12-21 11:11:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:11:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-21 11:11:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:19,190 INFO L225 Difference]: With dead ends: 653 [2023-12-21 11:11:19,191 INFO L226 Difference]: Without dead ends: 496 [2023-12-21 11:11:19,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:11:19,195 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 432 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:19,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 581 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-21 11:11:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 302. [2023-12-21 11:11:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 242 states have (on average 1.4173553719008265) internal successors, (343), 245 states have internal predecessors, (343), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2023-12-21 11:11:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2023-12-21 11:11:19,238 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 44 [2023-12-21 11:11:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:19,239 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2023-12-21 11:11:19,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2023-12-21 11:11:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 11:11:19,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:19,240 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] [2023-12-21 11:11:19,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:11:19,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:19,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1946946491, now seen corresponding path program 1 times [2023-12-21 11:11:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:19,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129459032] [2023-12-21 11:11:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,297 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:11:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129459032] [2023-12-21 11:11:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129459032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815223877] [2023-12-21 11:11:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:19,299 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:19,542 INFO L93 Difference]: Finished difference Result 1073 states and 1529 transitions. [2023-12-21 11:11:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-12-21 11:11:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:19,546 INFO L225 Difference]: With dead ends: 1073 [2023-12-21 11:11:19,547 INFO L226 Difference]: Without dead ends: 779 [2023-12-21 11:11:19,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:19,556 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 270 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:19,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 610 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-21 11:11:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 687. [2023-12-21 11:11:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 549 states have (on average 1.3624772313296905) internal successors, (748), 552 states have internal predecessors, (748), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-12-21 11:11:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 933 transitions. [2023-12-21 11:11:19,607 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 933 transitions. Word has length 45 [2023-12-21 11:11:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:19,607 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 933 transitions. [2023-12-21 11:11:19,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 933 transitions. [2023-12-21 11:11:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 11:11:19,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:19,608 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] [2023-12-21 11:11:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:11:19,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:19,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1308162012, now seen corresponding path program 1 times [2023-12-21 11:11:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324825815] [2023-12-21 11:11:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,652 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:11:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324825815] [2023-12-21 11:11:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324825815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93232755] [2023-12-21 11:11:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:19,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:19,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:19,653 INFO L87 Difference]: Start difference. First operand 687 states and 933 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:19,775 INFO L93 Difference]: Finished difference Result 1420 states and 1981 transitions. [2023-12-21 11:11:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:19,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-12-21 11:11:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:19,781 INFO L225 Difference]: With dead ends: 1420 [2023-12-21 11:11:19,782 INFO L226 Difference]: Without dead ends: 741 [2023-12-21 11:11:19,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:19,785 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:19,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 383 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-12-21 11:11:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 699. [2023-12-21 11:11:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 561 states have (on average 1.3475935828877006) internal successors, (756), 564 states have internal predecessors, (756), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-12-21 11:11:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 941 transitions. [2023-12-21 11:11:19,832 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 941 transitions. Word has length 45 [2023-12-21 11:11:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:19,832 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 941 transitions. [2023-12-21 11:11:19,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 941 transitions. [2023-12-21 11:11:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 11:11:19,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:19,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:19,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:11:19,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:19,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366950, now seen corresponding path program 1 times [2023-12-21 11:11:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473364245] [2023-12-21 11:11:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:19,913 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:11:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473364245] [2023-12-21 11:11:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473364245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516763962] [2023-12-21 11:11:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:19,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:19,914 INFO L87 Difference]: Start difference. First operand 699 states and 941 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:20,057 INFO L93 Difference]: Finished difference Result 1884 states and 2563 transitions. [2023-12-21 11:11:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2023-12-21 11:11:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:20,061 INFO L225 Difference]: With dead ends: 1884 [2023-12-21 11:11:20,061 INFO L226 Difference]: Without dead ends: 1255 [2023-12-21 11:11:20,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:20,062 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 164 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:20,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2023-12-21 11:11:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1172. [2023-12-21 11:11:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 943 states have (on average 1.3435843054082715) internal successors, (1267), 946 states have internal predecessors, (1267), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2023-12-21 11:11:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1576 transitions. [2023-12-21 11:11:20,129 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1576 transitions. Word has length 45 [2023-12-21 11:11:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:20,130 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1576 transitions. [2023-12-21 11:11:20,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1576 transitions. [2023-12-21 11:11:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 11:11:20,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:20,132 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] [2023-12-21 11:11:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:11:20,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:20,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -741508000, now seen corresponding path program 1 times [2023-12-21 11:11:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935791491] [2023-12-21 11:11:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,222 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:11:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935791491] [2023-12-21 11:11:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935791491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:20,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:20,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:11:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403391906] [2023-12-21 11:11:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:20,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:20,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:20,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:20,224 INFO L87 Difference]: Start difference. First operand 1172 states and 1576 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:20,423 INFO L93 Difference]: Finished difference Result 2250 states and 3058 transitions. [2023-12-21 11:11:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:11:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2023-12-21 11:11:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:20,427 INFO L225 Difference]: With dead ends: 2250 [2023-12-21 11:11:20,427 INFO L226 Difference]: Without dead ends: 1415 [2023-12-21 11:11:20,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:20,429 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 375 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:20,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 502 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-12-21 11:11:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1317. [2023-12-21 11:11:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1062 states have (on average 1.3408662900188324) internal successors, (1424), 1065 states have internal predecessors, (1424), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2023-12-21 11:11:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1767 transitions. [2023-12-21 11:11:20,470 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1767 transitions. Word has length 53 [2023-12-21 11:11:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:20,471 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1767 transitions. [2023-12-21 11:11:20,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1767 transitions. [2023-12-21 11:11:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:11:20,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:20,471 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] [2023-12-21 11:11:20,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:11:20,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:20,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1263305305, now seen corresponding path program 1 times [2023-12-21 11:11:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:20,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216997379] [2023-12-21 11:11:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,528 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:11:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216997379] [2023-12-21 11:11:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216997379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:11:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705841456] [2023-12-21 11:11:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:20,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:11:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:11:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:20,530 INFO L87 Difference]: Start difference. First operand 1317 states and 1767 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:20,752 INFO L93 Difference]: Finished difference Result 3271 states and 4430 transitions. [2023-12-21 11:11:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:11:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2023-12-21 11:11:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:20,758 INFO L225 Difference]: With dead ends: 3271 [2023-12-21 11:11:20,758 INFO L226 Difference]: Without dead ends: 2024 [2023-12-21 11:11:20,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:11:20,760 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 368 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:20,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 558 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-12-21 11:11:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1868. [2023-12-21 11:11:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1509 states have (on average 1.3386348575215374) internal successors, (2020), 1512 states have internal predecessors, (2020), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2023-12-21 11:11:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2505 transitions. [2023-12-21 11:11:20,815 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2505 transitions. Word has length 56 [2023-12-21 11:11:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2505 transitions. [2023-12-21 11:11:20,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 11:11:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2505 transitions. [2023-12-21 11:11:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 11:11:20,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:20,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:11:20,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:20,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -109102014, now seen corresponding path program 1 times [2023-12-21 11:11:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70284360] [2023-12-21 11:11:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:11:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 11:11:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:20,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70284360] [2023-12-21 11:11:20,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70284360] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:20,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248279824] [2023-12-21 11:11:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:20,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:20,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:20,900 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:11:20,919 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:11:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:20,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:20,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:11:21,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248279824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:11:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089043886] [2023-12-21 11:11:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:21,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:21,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:21,031 INFO L87 Difference]: Start difference. First operand 1868 states and 2505 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 11:11:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:21,159 INFO L93 Difference]: Finished difference Result 5196 states and 7106 transitions. [2023-12-21 11:11:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:21,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2023-12-21 11:11:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:21,171 INFO L225 Difference]: With dead ends: 5196 [2023-12-21 11:11:21,171 INFO L226 Difference]: Without dead ends: 3337 [2023-12-21 11:11:21,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:21,177 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 86 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:21,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 310 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2023-12-21 11:11:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3212. [2023-12-21 11:11:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2564 states have (on average 1.3151326053042123) internal successors, (3372), 2568 states have internal predecessors, (3372), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2023-12-21 11:11:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4327 transitions. [2023-12-21 11:11:21,310 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4327 transitions. Word has length 61 [2023-12-21 11:11:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:21,311 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 4327 transitions. [2023-12-21 11:11:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 11:11:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4327 transitions. [2023-12-21 11:11:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-21 11:11:21,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:21,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:21,322 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:11:21,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:21,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:21,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash -376855157, now seen corresponding path program 1 times [2023-12-21 11:11:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:21,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408996506] [2023-12-21 11:11:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:11:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408996506] [2023-12-21 11:11:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408996506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:11:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033168164] [2023-12-21 11:11:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:21,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:11:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:11:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:21,604 INFO L87 Difference]: Start difference. First operand 3212 states and 4327 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 11:11:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:21,832 INFO L93 Difference]: Finished difference Result 6660 states and 9019 transitions. [2023-12-21 11:11:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2023-12-21 11:11:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:21,847 INFO L225 Difference]: With dead ends: 6660 [2023-12-21 11:11:21,847 INFO L226 Difference]: Without dead ends: 3461 [2023-12-21 11:11:21,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:21,854 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 149 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:21,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 362 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2023-12-21 11:11:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3250. [2023-12-21 11:11:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2583 states have (on average 1.2942315137437088) internal successors, (3343), 2606 states have internal predecessors, (3343), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2023-12-21 11:11:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4298 transitions. [2023-12-21 11:11:22,018 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4298 transitions. Word has length 62 [2023-12-21 11:11:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:22,019 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 4298 transitions. [2023-12-21 11:11:22,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 11:11:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4298 transitions. [2023-12-21 11:11:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-21 11:11:22,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:22,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:22,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:11:22,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:22,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash -336180407, now seen corresponding path program 1 times [2023-12-21 11:11:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062763223] [2023-12-21 11:11:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,050 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:11:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062763223] [2023-12-21 11:11:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062763223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:11:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015339780] [2023-12-21 11:11:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:22,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:22,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:22,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:22,051 INFO L87 Difference]: Start difference. First operand 3250 states and 4298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:22,176 INFO L93 Difference]: Finished difference Result 3660 states and 4878 transitions. [2023-12-21 11:11:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:11:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-21 11:11:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:22,186 INFO L225 Difference]: With dead ends: 3660 [2023-12-21 11:11:22,186 INFO L226 Difference]: Without dead ends: 3476 [2023-12-21 11:11:22,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:22,187 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 162 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:22,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 178 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2023-12-21 11:11:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3187. [2023-12-21 11:11:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 2536 states have (on average 1.2953470031545742) internal successors, (3285), 2558 states have internal predecessors, (3285), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2023-12-21 11:11:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4218 transitions. [2023-12-21 11:11:22,322 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4218 transitions. Word has length 62 [2023-12-21 11:11:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:22,322 INFO L495 AbstractCegarLoop]: Abstraction has 3187 states and 4218 transitions. [2023-12-21 11:11:22,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 11:11:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4218 transitions. [2023-12-21 11:11:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-21 11:11:22,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:22,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:22,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:11:22,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:22,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash 90638681, now seen corresponding path program 1 times [2023-12-21 11:11:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32596933] [2023-12-21 11:11:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 11:11:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 11:11:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32596933] [2023-12-21 11:11:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32596933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:11:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451935212] [2023-12-21 11:11:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:22,360 INFO L87 Difference]: Start difference. First operand 3187 states and 4218 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 11:11:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:22,785 INFO L93 Difference]: Finished difference Result 9519 states and 12993 transitions. [2023-12-21 11:11:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:11:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2023-12-21 11:11:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:22,807 INFO L225 Difference]: With dead ends: 9519 [2023-12-21 11:11:22,807 INFO L226 Difference]: Without dead ends: 6176 [2023-12-21 11:11:22,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-21 11:11:22,816 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 577 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:22,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 635 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:11:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2023-12-21 11:11:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6046. [2023-12-21 11:11:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6046 states, 4768 states have (on average 1.2523070469798658) internal successors, (5971), 4830 states have internal predecessors, (5971), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2023-12-21 11:11:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 7876 transitions. [2023-12-21 11:11:23,094 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 7876 transitions. Word has length 63 [2023-12-21 11:11:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 7876 transitions. [2023-12-21 11:11:23,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 11:11:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 7876 transitions. [2023-12-21 11:11:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 11:11:23,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:23,099 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:23,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:11:23,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:23,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 551115313, now seen corresponding path program 1 times [2023-12-21 11:11:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518004198] [2023-12-21 11:11:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 11:11:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 11:11:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 11:11:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 11:11:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 11:11:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-21 11:11:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 11:11:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 11:11:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518004198] [2023-12-21 11:11:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518004198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954723550] [2023-12-21 11:11:23,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:23,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:23,190 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:11:23,220 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:11:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:23,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 11:11:23,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954723550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-21 11:11:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218164964] [2023-12-21 11:11:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:23,320 INFO L87 Difference]: Start difference. First operand 6046 states and 7876 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:11:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:23,481 INFO L93 Difference]: Finished difference Result 10046 states and 13154 transitions. [2023-12-21 11:11:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 11:11:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:23,492 INFO L225 Difference]: With dead ends: 10046 [2023-12-21 11:11:23,492 INFO L226 Difference]: Without dead ends: 3828 [2023-12-21 11:11:23,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:23,503 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:23,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2023-12-21 11:11:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3824. [2023-12-21 11:11:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3016 states have (on average 1.2374005305039788) internal successors, (3732), 3052 states have internal predecessors, (3732), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2023-12-21 11:11:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4904 transitions. [2023-12-21 11:11:23,687 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4904 transitions. Word has length 113 [2023-12-21 11:11:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:23,687 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4904 transitions. [2023-12-21 11:11:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:11:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4904 transitions. [2023-12-21 11:11:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 11:11:23,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:23,689 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:23,704 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:11:23,894 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,SelfDestructingSolverStorable12 [2023-12-21 11:11:23,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:23,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1763703259, now seen corresponding path program 1 times [2023-12-21 11:11:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301152263] [2023-12-21 11:11:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 11:11:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:11:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 11:11:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 11:11:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 11:11:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 11:11:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-21 11:11:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-21 11:11:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301152263] [2023-12-21 11:11:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301152263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638925573] [2023-12-21 11:11:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:23,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:23,981 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:11:23,988 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:11:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:24,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-21 11:11:24,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638925573] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-21 11:11:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045817213] [2023-12-21 11:11:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:24,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:24,110 INFO L87 Difference]: Start difference. First operand 3824 states and 4904 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:11:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:24,296 INFO L93 Difference]: Finished difference Result 8159 states and 10428 transitions. [2023-12-21 11:11:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-21 11:11:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:24,324 INFO L225 Difference]: With dead ends: 8159 [2023-12-21 11:11:24,324 INFO L226 Difference]: Without dead ends: 4632 [2023-12-21 11:11:24,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:24,331 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 43 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:24,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 224 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2023-12-21 11:11:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2023-12-21 11:11:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 3640 states have (on average 1.2230769230769232) internal successors, (4452), 3680 states have internal predecessors, (4452), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2023-12-21 11:11:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5844 transitions. [2023-12-21 11:11:24,516 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5844 transitions. Word has length 115 [2023-12-21 11:11:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:24,516 INFO L495 AbstractCegarLoop]: Abstraction has 4632 states and 5844 transitions. [2023-12-21 11:11:24,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:11:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5844 transitions. [2023-12-21 11:11:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 11:11:24,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:24,520 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:24,524 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:11:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:24,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:24,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash -607311514, now seen corresponding path program 1 times [2023-12-21 11:11:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410928324] [2023-12-21 11:11:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 11:11:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:11:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 11:11:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-21 11:11:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:11:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-21 11:11:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 11:11:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-21 11:11:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410928324] [2023-12-21 11:11:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410928324] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890922967] [2023-12-21 11:11:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:24,805 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:11:24,807 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:11:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:24,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:11:24,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 11:11:24,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890922967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:24,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-21 11:11:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886798624] [2023-12-21 11:11:24,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:24,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:24,896 INFO L87 Difference]: Start difference. First operand 4632 states and 5844 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 11:11:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:25,151 INFO L93 Difference]: Finished difference Result 12231 states and 15568 transitions. [2023-12-21 11:11:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 135 [2023-12-21 11:11:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:25,172 INFO L225 Difference]: With dead ends: 12231 [2023-12-21 11:11:25,172 INFO L226 Difference]: Without dead ends: 7814 [2023-12-21 11:11:25,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:25,181 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:25,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 306 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7814 states. [2023-12-21 11:11:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7814 to 7810. [2023-12-21 11:11:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7810 states, 6166 states have (on average 1.1959130716834252) internal successors, (7374), 6222 states have internal predecessors, (7374), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2023-12-21 11:11:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 9686 transitions. [2023-12-21 11:11:25,551 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 9686 transitions. Word has length 135 [2023-12-21 11:11:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:25,552 INFO L495 AbstractCegarLoop]: Abstraction has 7810 states and 9686 transitions. [2023-12-21 11:11:25,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 11:11:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 9686 transitions. [2023-12-21 11:11:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 11:11:25,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:25,556 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:25,576 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:11:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 11:11:25,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:25,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash -629943768, now seen corresponding path program 1 times [2023-12-21 11:11:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549446542] [2023-12-21 11:11:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 11:11:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:11:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 11:11:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-21 11:11:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:11:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-21 11:11:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 11:11:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-21 11:11:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549446542] [2023-12-21 11:11:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549446542] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521877215] [2023-12-21 11:11:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:25,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:25,857 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:11:25,913 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:11:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:25,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:11:25,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-21 11:11:26,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521877215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-21 11:11:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358878065] [2023-12-21 11:11:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:26,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:11:26,007 INFO L87 Difference]: Start difference. First operand 7810 states and 9686 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:11:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:26,172 INFO L93 Difference]: Finished difference Result 12624 states and 15700 transitions. [2023-12-21 11:11:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:11:26,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2023-12-21 11:11:26,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:26,181 INFO L225 Difference]: With dead ends: 12624 [2023-12-21 11:11:26,181 INFO L226 Difference]: Without dead ends: 4823 [2023-12-21 11:11:26,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 11:11:26,192 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 43 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:26,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 534 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2023-12-21 11:11:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4531. [2023-12-21 11:11:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3758 states have (on average 1.1971793507184674) internal successors, (4499), 3770 states have internal predecessors, (4499), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2023-12-21 11:11:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5584 transitions. [2023-12-21 11:11:26,322 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5584 transitions. Word has length 135 [2023-12-21 11:11:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:26,323 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 5584 transitions. [2023-12-21 11:11:26,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:11:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5584 transitions. [2023-12-21 11:11:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 11:11:26,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:26,325 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:26,331 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:11:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 11:11:26,532 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:26,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 92477145, now seen corresponding path program 1 times [2023-12-21 11:11:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986103164] [2023-12-21 11:11:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 11:11:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 11:11:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 11:11:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 11:11:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 11:11:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-21 11:11:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-21 11:11:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 11:11:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-21 11:11:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-21 11:11:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986103164] [2023-12-21 11:11:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986103164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:11:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935537091] [2023-12-21 11:11:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:26,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:11:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:11:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:26,602 INFO L87 Difference]: Start difference. First operand 4531 states and 5584 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:26,769 INFO L93 Difference]: Finished difference Result 4695 states and 5778 transitions. [2023-12-21 11:11:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:11:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2023-12-21 11:11:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:26,776 INFO L225 Difference]: With dead ends: 4695 [2023-12-21 11:11:26,776 INFO L226 Difference]: Without dead ends: 4450 [2023-12-21 11:11:26,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:26,777 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:26,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 252 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2023-12-21 11:11:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4289. [2023-12-21 11:11:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 3558 states have (on average 1.2003934794828555) internal successors, (4271), 3569 states have internal predecessors, (4271), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2023-12-21 11:11:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 5307 transitions. [2023-12-21 11:11:26,930 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 5307 transitions. Word has length 139 [2023-12-21 11:11:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:26,930 INFO L495 AbstractCegarLoop]: Abstraction has 4289 states and 5307 transitions. [2023-12-21 11:11:26,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 5307 transitions. [2023-12-21 11:11:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-21 11:11:26,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:26,932 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 11:11:26,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1401567099, now seen corresponding path program 1 times [2023-12-21 11:11:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050989381] [2023-12-21 11:11:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 11:11:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 11:11:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-21 11:11:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-21 11:11:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 11:11:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 11:11:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-21 11:11:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 11:11:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-21 11:11:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050989381] [2023-12-21 11:11:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050989381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241139615] [2023-12-21 11:11:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:27,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:27,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:27,012 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:11:27,017 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:11:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:27,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 11:11:27,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241139615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-12-21 11:11:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134626245] [2023-12-21 11:11:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:27,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:27,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:11:27,161 INFO L87 Difference]: Start difference. First operand 4289 states and 5307 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:27,256 INFO L93 Difference]: Finished difference Result 8042 states and 9995 transitions. [2023-12-21 11:11:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:27,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2023-12-21 11:11:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:27,263 INFO L225 Difference]: With dead ends: 8042 [2023-12-21 11:11:27,263 INFO L226 Difference]: Without dead ends: 3984 [2023-12-21 11:11:27,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:11:27,269 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 24 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:27,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 217 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2023-12-21 11:11:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3984. [2023-12-21 11:11:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3322 states have (on average 1.2034918723660446) internal successors, (3998), 3333 states have internal predecessors, (3998), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2023-12-21 11:11:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4943 transitions. [2023-12-21 11:11:27,376 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4943 transitions. Word has length 144 [2023-12-21 11:11:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:27,377 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4943 transitions. [2023-12-21 11:11:27,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4943 transitions. [2023-12-21 11:11:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-21 11:11:27,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:27,379 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:27,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:27,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 11:11:27,586 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:27,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 151733564, now seen corresponding path program 1 times [2023-12-21 11:11:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880204948] [2023-12-21 11:11:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 11:11:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 11:11:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-21 11:11:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-21 11:11:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 11:11:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 11:11:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-21 11:11:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 11:11:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-21 11:11:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880204948] [2023-12-21 11:11:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880204948] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888497017] [2023-12-21 11:11:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:27,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:27,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:27,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 11:11:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:27,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:11:27,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 11:11:27,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888497017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-21 11:11:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068227212] [2023-12-21 11:11:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:27,739 INFO L87 Difference]: Start difference. First operand 3984 states and 4943 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:27,847 INFO L93 Difference]: Finished difference Result 7704 states and 9687 transitions. [2023-12-21 11:11:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 144 [2023-12-21 11:11:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:27,854 INFO L225 Difference]: With dead ends: 7704 [2023-12-21 11:11:27,854 INFO L226 Difference]: Without dead ends: 3855 [2023-12-21 11:11:27,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:27,858 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 78 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:27,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 245 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2023-12-21 11:11:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3852. [2023-12-21 11:11:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3190 states have (on average 1.1846394984326019) internal successors, (3779), 3201 states have internal predecessors, (3779), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2023-12-21 11:11:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 4724 transitions. [2023-12-21 11:11:27,984 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 4724 transitions. Word has length 144 [2023-12-21 11:11:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:27,984 INFO L495 AbstractCegarLoop]: Abstraction has 3852 states and 4724 transitions. [2023-12-21 11:11:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 4724 transitions. [2023-12-21 11:11:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-21 11:11:27,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:27,985 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:27,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:28,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:28,191 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:28,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1828873167, now seen corresponding path program 1 times [2023-12-21 11:11:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862070276] [2023-12-21 11:11:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 11:11:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 11:11:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 11:11:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-21 11:11:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 11:11:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-21 11:11:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-21 11:11:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 11:11:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-21 11:11:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-21 11:11:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862070276] [2023-12-21 11:11:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862070276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:11:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:11:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486491302] [2023-12-21 11:11:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:28,267 INFO L87 Difference]: Start difference. First operand 3852 states and 4724 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:28,511 INFO L93 Difference]: Finished difference Result 8291 states and 10182 transitions. [2023-12-21 11:11:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:11:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2023-12-21 11:11:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:28,522 INFO L225 Difference]: With dead ends: 8291 [2023-12-21 11:11:28,523 INFO L226 Difference]: Without dead ends: 4482 [2023-12-21 11:11:28,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:28,527 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 138 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:28,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 542 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2023-12-21 11:11:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4253. [2023-12-21 11:11:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 3522 states have (on average 1.1819988642816581) internal successors, (4163), 3537 states have internal predecessors, (4163), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2023-12-21 11:11:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5201 transitions. [2023-12-21 11:11:28,693 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5201 transitions. Word has length 145 [2023-12-21 11:11:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:28,693 INFO L495 AbstractCegarLoop]: Abstraction has 4253 states and 5201 transitions. [2023-12-21 11:11:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 11:11:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5201 transitions. [2023-12-21 11:11:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-21 11:11:28,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:28,695 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:28,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 11:11:28,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:28,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 525296427, now seen corresponding path program 1 times [2023-12-21 11:11:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292642579] [2023-12-21 11:11:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 11:11:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 11:11:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:11:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-21 11:11:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 11:11:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 11:11:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-21 11:11:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 11:11:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-21 11:11:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292642579] [2023-12-21 11:11:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292642579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110381728] [2023-12-21 11:11:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:28,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:28,756 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:28,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 11:11:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:28,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:28,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-21 11:11:28,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110381728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:11:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580451540] [2023-12-21 11:11:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:28,950 INFO L87 Difference]: Start difference. First operand 4253 states and 5201 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:29,113 INFO L93 Difference]: Finished difference Result 7878 states and 9665 transitions. [2023-12-21 11:11:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2023-12-21 11:11:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:29,119 INFO L225 Difference]: With dead ends: 7878 [2023-12-21 11:11:29,119 INFO L226 Difference]: Without dead ends: 3705 [2023-12-21 11:11:29,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 179 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:11:29,123 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 54 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:29,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 240 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2023-12-21 11:11:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3459. [2023-12-21 11:11:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2879 states have (on average 1.1764501563042724) internal successors, (3387), 2890 states have internal predecessors, (3387), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2023-12-21 11:11:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4160 transitions. [2023-12-21 11:11:29,264 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4160 transitions. Word has length 150 [2023-12-21 11:11:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:29,264 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4160 transitions. [2023-12-21 11:11:29,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4160 transitions. [2023-12-21 11:11:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-21 11:11:29,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:29,266 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:29,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:29,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-21 11:11:29,470 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:29,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash 204611596, now seen corresponding path program 1 times [2023-12-21 11:11:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570120486] [2023-12-21 11:11:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 11:11:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 11:11:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:11:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-21 11:11:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 11:11:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 11:11:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-21 11:11:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 11:11:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-21 11:11:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570120486] [2023-12-21 11:11:29,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570120486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751643851] [2023-12-21 11:11:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:29,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:29,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 11:11:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:29,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:11:29,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-21 11:11:29,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751643851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:29,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-21 11:11:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736310412] [2023-12-21 11:11:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:29,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:29,643 INFO L87 Difference]: Start difference. First operand 3459 states and 4160 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:29,766 INFO L93 Difference]: Finished difference Result 4003 states and 4819 transitions. [2023-12-21 11:11:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2023-12-21 11:11:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:29,773 INFO L225 Difference]: With dead ends: 4003 [2023-12-21 11:11:29,774 INFO L226 Difference]: Without dead ends: 3462 [2023-12-21 11:11:29,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:11:29,775 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:29,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2023-12-21 11:11:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3459. [2023-12-21 11:11:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2879 states have (on average 1.1719346995484543) internal successors, (3374), 2890 states have internal predecessors, (3374), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2023-12-21 11:11:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4147 transitions. [2023-12-21 11:11:29,900 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4147 transitions. Word has length 150 [2023-12-21 11:11:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:29,901 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4147 transitions. [2023-12-21 11:11:29,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:11:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4147 transitions. [2023-12-21 11:11:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-21 11:11:29,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:29,902 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:29,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:30,109 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:30,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash -538576786, now seen corresponding path program 1 times [2023-12-21 11:11:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850658768] [2023-12-21 11:11:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 11:11:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 11:11:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:11:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 11:11:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-21 11:11:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 11:11:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 11:11:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 11:11:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-21 11:11:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850658768] [2023-12-21 11:11:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850658768] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239284941] [2023-12-21 11:11:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:30,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:30,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:30,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:30,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 11:11:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:30,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 11:11:30,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-21 11:11:30,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:11:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-21 11:11:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239284941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:11:30,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:11:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 6 [2023-12-21 11:11:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985121254] [2023-12-21 11:11:30,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:11:30,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:11:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:11:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:11:30,517 INFO L87 Difference]: Start difference. First operand 3459 states and 4147 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-21 11:11:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:30,772 INFO L93 Difference]: Finished difference Result 6182 states and 7415 transitions. [2023-12-21 11:11:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 11:11:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 152 [2023-12-21 11:11:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:30,779 INFO L225 Difference]: With dead ends: 6182 [2023-12-21 11:11:30,779 INFO L226 Difference]: Without dead ends: 3862 [2023-12-21 11:11:30,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:11:30,782 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:30,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 600 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:11:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2023-12-21 11:11:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3714. [2023-12-21 11:11:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3089 states have (on average 1.1693104564584007) internal successors, (3612), 3100 states have internal predecessors, (3612), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2023-12-21 11:11:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4441 transitions. [2023-12-21 11:11:30,920 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4441 transitions. Word has length 152 [2023-12-21 11:11:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:30,920 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 4441 transitions. [2023-12-21 11:11:30,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-21 11:11:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4441 transitions. [2023-12-21 11:11:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-21 11:11:30,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:30,925 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-21 11:11:30,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-21 11:11:31,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-21 11:11:31,130 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:31,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2090905181, now seen corresponding path program 1 times [2023-12-21 11:11:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970458246] [2023-12-21 11:11:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 11:11:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 11:11:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:11:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 11:11:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-21 11:11:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 11:11:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 11:11:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 11:11:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-21 11:11:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-21 11:11:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-12-21 11:11:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-21 11:11:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-21 11:11:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-21 11:11:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:11:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:11:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 101 proven. 29 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-12-21 11:11:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970458246] [2023-12-21 11:11:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970458246] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604262803] [2023-12-21 11:11:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:31,219 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 11:11:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:11:31,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-12-21 11:11:31,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604262803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:31,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-21 11:11:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157967591] [2023-12-21 11:11:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:31,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:31,364 INFO L87 Difference]: Start difference. First operand 3714 states and 4441 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:11:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:31,522 INFO L93 Difference]: Finished difference Result 9349 states and 11210 transitions. [2023-12-21 11:11:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:31,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 223 [2023-12-21 11:11:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:31,530 INFO L225 Difference]: With dead ends: 9349 [2023-12-21 11:11:31,531 INFO L226 Difference]: Without dead ends: 5818 [2023-12-21 11:11:31,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:11:31,535 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:31,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 290 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2023-12-21 11:11:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5712. [2023-12-21 11:11:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5712 states, 4747 states have (on average 1.1601011164946282) internal successors, (5507), 4758 states have internal predecessors, (5507), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2023-12-21 11:11:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 6779 transitions. [2023-12-21 11:11:31,706 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 6779 transitions. Word has length 223 [2023-12-21 11:11:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:31,706 INFO L495 AbstractCegarLoop]: Abstraction has 5712 states and 6779 transitions. [2023-12-21 11:11:31,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:11:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 6779 transitions. [2023-12-21 11:11:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-21 11:11:31,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:31,714 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-21 11:11:31,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-21 11:11:31,919 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:31,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash 337353441, now seen corresponding path program 1 times [2023-12-21 11:11:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:31,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638842874] [2023-12-21 11:11:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:11:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 11:11:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 11:11:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:11:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:11:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 11:11:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 11:11:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 11:11:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 11:11:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 11:11:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 11:11:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-21 11:11:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 11:11:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-21 11:11:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 11:11:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-21 11:11:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-21 11:11:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-12-21 11:11:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-21 11:11:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-21 11:11:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-21 11:11:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:11:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:11:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-21 11:11:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:11:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638842874] [2023-12-21 11:11:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638842874] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:11:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709478346] [2023-12-21 11:11:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:31,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:11:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:11:31,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:11:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 11:11:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:11:32,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:11:32,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:11:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-21 11:11:32,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:11:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709478346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:11:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:11:32,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-12-21 11:11:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115061841] [2023-12-21 11:11:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:11:32,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:11:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:11:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:11:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:32,100 INFO L87 Difference]: Start difference. First operand 5712 states and 6779 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-21 11:11:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:11:32,183 INFO L93 Difference]: Finished difference Result 7860 states and 9327 transitions. [2023-12-21 11:11:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:11:32,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 223 [2023-12-21 11:11:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:11:32,188 INFO L225 Difference]: With dead ends: 7860 [2023-12-21 11:11:32,188 INFO L226 Difference]: Without dead ends: 2279 [2023-12-21 11:11:32,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:11:32,193 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:11:32,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 231 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:11:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-12-21 11:11:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2023-12-21 11:11:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1878 states have (on average 1.1325878594249201) internal successors, (2127), 1891 states have internal predecessors, (2127), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2023-12-21 11:11:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2627 transitions. [2023-12-21 11:11:32,267 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2627 transitions. Word has length 223 [2023-12-21 11:11:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:11:32,267 INFO L495 AbstractCegarLoop]: Abstraction has 2279 states and 2627 transitions. [2023-12-21 11:11:32,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-21 11:11:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2627 transitions. [2023-12-21 11:11:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-21 11:11:32,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:11:32,270 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-12-21 11:11:32,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 11:11:32,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-21 11:11:32,475 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:11:32,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:11:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -738756182, now seen corresponding path program 1 times [2023-12-21 11:11:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:11:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498694068] [2023-12-21 11:11:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:11:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:11:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:11:32,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 11:11:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:11:32,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 11:11:32,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 11:11:32,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:11:32,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 11:11:32,557 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:11:32,559 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:11:32,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:11:32 BoogieIcfgContainer [2023-12-21 11:11:32,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:11:32,677 INFO L158 Benchmark]: Toolchain (without parser) took 15537.66ms. Allocated memory was 250.6MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 208.0MB in the beginning and 593.9MB in the end (delta: -385.9MB). Peak memory consumption was 857.9MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,677 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:11:32,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.79ms. Allocated memory is still 250.6MB. Free memory was 207.7MB in the beginning and 193.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.65ms. Allocated memory is still 250.6MB. Free memory was 193.7MB in the beginning and 191.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,678 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 250.6MB. Free memory was 191.6MB in the beginning and 189.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,679 INFO L158 Benchmark]: RCFGBuilder took 459.05ms. Allocated memory is still 250.6MB. Free memory was 189.2MB in the beginning and 168.5MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,680 INFO L158 Benchmark]: TraceAbstraction took 14782.89ms. Allocated memory was 250.6MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 167.8MB in the beginning and 593.9MB in the end (delta: -426.1MB). Peak memory consumption was 818.0MB. Max. memory is 8.0GB. [2023-12-21 11:11:32,685 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 203.4MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.79ms. Allocated memory is still 250.6MB. Free memory was 207.7MB in the beginning and 193.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.65ms. Allocated memory is still 250.6MB. Free memory was 193.7MB in the beginning and 191.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 250.6MB. Free memory was 191.6MB in the beginning and 189.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 459.05ms. Allocated memory is still 250.6MB. Free memory was 189.2MB in the beginning and 168.5MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 14782.89ms. Allocated memory was 250.6MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 167.8MB in the beginning and 593.9MB in the end (delta: -426.1MB). Peak memory consumption was 818.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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(c)=65, \old(i___0)=0, c=65, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3964 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3854 mSDsluCounter, 9528 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5671 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3019 IncrementalHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 3857 mSDtfsCounter, 3019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2594 GetRequests, 2452 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7810occurred in iteration=15, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2658 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 4581 NumberOfCodeBlocks, 4581 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4451 ConstructedInterpolants, 0 QuantifiedInterpolants, 7548 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5071 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 3667/3909 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:11:32,701 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...