./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 19:03:33,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 19:03:33,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 19:03:33,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 19:03:33,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 19:03:33,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 19:03:33,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 19:03:33,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 19:03:33,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 19:03:33,891 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 19:03:33,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 19:03:33,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 19:03:33,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 19:03:33,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 19:03:33,894 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 19:03:33,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 19:03:33,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 19:03:33,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 19:03:33,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 19:03:33,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 19:03:33,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 19:03:33,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 19:03:33,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 19:03:33,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 19:03:33,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 19:03:33,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 19:03:33,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 19:03:33,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 19:03:33,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 19:03:33,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 19:03:33,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 19:03:33,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:03:33,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 19:03:33,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 19:03:33,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 19:03:33,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 19:03:33,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 19:03:33,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 19:03:33,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 19:03:33,900 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 19:03:33,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 19:03:33,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 19:03:33,901 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2023-11-22 19:03:34,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 19:03:34,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 19:03:34,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 19:03:34,120 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 19:03:34,121 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 19:03:34,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2023-11-22 19:03:35,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 19:03:35,283 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 19:03:35,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2023-11-22 19:03:35,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae462232/f7843d76cf864e0181d903d0484bb058/FLAGd02317bbb [2023-11-22 19:03:35,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae462232/f7843d76cf864e0181d903d0484bb058 [2023-11-22 19:03:35,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 19:03:35,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 19:03:35,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 19:03:35,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 19:03:35,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 19:03:35,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f83bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35, skipping insertion in model container [2023-11-22 19:03:35,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 19:03:35,490 WARN L240 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-11-22 19:03:35,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:03:35,538 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 19:03:35,547 WARN L240 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-11-22 19:03:35,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:03:35,577 INFO L206 MainTranslator]: Completed translation [2023-11-22 19:03:35,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35 WrapperNode [2023-11-22 19:03:35,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 19:03:35,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 19:03:35,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 19:03:35,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 19:03:35,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,606 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2023-11-22 19:03:35,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 19:03:35,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 19:03:35,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 19:03:35,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 19:03:35,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,617 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,629 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 19:03:35,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 19:03:35,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 19:03:35,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 19:03:35,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 19:03:35,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (1/1) ... [2023-11-22 19:03:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:03:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:35,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 19:03:35,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 19:03:35,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 19:03:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-22 19:03:35,705 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-22 19:03:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-22 19:03:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-22 19:03:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-22 19:03:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-22 19:03:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-22 19:03:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-22 19:03:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-22 19:03:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-22 19:03:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 19:03:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-22 19:03:35,707 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-22 19:03:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 19:03:35,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 19:03:35,768 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 19:03:35,770 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 19:03:36,000 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 19:03:36,024 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 19:03:36,024 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-22 19:03:36,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:03:36 BoogieIcfgContainer [2023-11-22 19:03:36,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 19:03:36,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 19:03:36,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 19:03:36,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 19:03:36,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:03:35" (1/3) ... [2023-11-22 19:03:36,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797e776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:03:36, skipping insertion in model container [2023-11-22 19:03:36,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:03:35" (2/3) ... [2023-11-22 19:03:36,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797e776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:03:36, skipping insertion in model container [2023-11-22 19:03:36,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:03:36" (3/3) ... [2023-11-22 19:03:36,032 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-11-22 19:03:36,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 19:03:36,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 19:03:36,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 19:03:36,080 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;@64a50fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 19:03:36,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 19:03:36,083 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-11-22 19:03:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 19:03:36,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:36,089 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-11-22 19:03:36,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:36,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 351875085, now seen corresponding path program 1 times [2023-11-22 19:03:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472369004] [2023-11-22 19:03:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 19:03:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:03:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472369004] [2023-11-22 19:03:36,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472369004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:36,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:36,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69838199] [2023-11-22 19:03:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:36,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:36,435 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-11-22 19:03:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:36,763 INFO L93 Difference]: Finished difference Result 282 states and 434 transitions. [2023-11-22 19:03:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:36,765 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-11-22 19:03:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:36,777 INFO L225 Difference]: With dead ends: 282 [2023-11-22 19:03:36,777 INFO L226 Difference]: Without dead ends: 191 [2023-11-22 19:03:36,780 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-11-22 19:03:36,783 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 271 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:36,784 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.2s Time] [2023-11-22 19:03:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-22 19:03:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2023-11-22 19:03:36,834 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-11-22 19:03:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2023-11-22 19:03:36,838 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 44 [2023-11-22 19:03:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:36,839 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2023-11-22 19:03:36,839 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-11-22 19:03:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2023-11-22 19:03:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 19:03:36,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:36,840 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-11-22 19:03:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 19:03:36,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:36,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1419595890, now seen corresponding path program 1 times [2023-11-22 19:03:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540435787] [2023-11-22 19:03:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 19:03:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:03:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540435787] [2023-11-22 19:03:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540435787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340929703] [2023-11-22 19:03:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:36,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:36,943 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-11-22 19:03:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:37,068 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2023-11-22 19:03:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:37,068 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-11-22 19:03:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:37,071 INFO L225 Difference]: With dead ends: 334 [2023-11-22 19:03:37,071 INFO L226 Difference]: Without dead ends: 179 [2023-11-22 19:03:37,077 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-11-22 19:03:37,078 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-11-22 19:03:37,079 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-11-22 19:03:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-22 19:03:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2023-11-22 19:03:37,090 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-11-22 19:03:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 232 transitions. [2023-11-22 19:03:37,091 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 232 transitions. Word has length 44 [2023-11-22 19:03:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:37,091 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 232 transitions. [2023-11-22 19:03:37,091 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-11-22 19:03:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 232 transitions. [2023-11-22 19:03:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 19:03:37,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:37,093 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-11-22 19:03:37,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 19:03:37,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:37,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1929068980, now seen corresponding path program 1 times [2023-11-22 19:03:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004740000] [2023-11-22 19:03:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 19:03:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:03:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004740000] [2023-11-22 19:03:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004740000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:37,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:03:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538519892] [2023-11-22 19:03:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:37,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:37,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:37,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:37,202 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-11-22 19:03:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:37,579 INFO L93 Difference]: Finished difference Result 653 states and 933 transitions. [2023-11-22 19:03:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:03:37,579 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-11-22 19:03:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:37,585 INFO L225 Difference]: With dead ends: 653 [2023-11-22 19:03:37,585 INFO L226 Difference]: Without dead ends: 496 [2023-11-22 19:03:37,589 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-11-22 19:03:37,592 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.3s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:37,593 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.3s Time] [2023-11-22 19:03:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-22 19:03:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 302. [2023-11-22 19:03:37,627 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-11-22 19:03:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2023-11-22 19:03:37,629 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 44 [2023-11-22 19:03:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:37,629 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2023-11-22 19:03:37,630 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-11-22 19:03:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2023-11-22 19:03:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 19:03:37,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:37,631 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-11-22 19:03:37,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 19:03:37,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:37,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1946946491, now seen corresponding path program 1 times [2023-11-22 19:03:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:37,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447429811] [2023-11-22 19:03:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447429811] [2023-11-22 19:03:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447429811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:37,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380421712] [2023-11-22 19:03:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:37,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:37,700 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-11-22 19:03:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:37,919 INFO L93 Difference]: Finished difference Result 1073 states and 1529 transitions. [2023-11-22 19:03:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:37,920 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-11-22 19:03:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:37,923 INFO L225 Difference]: With dead ends: 1073 [2023-11-22 19:03:37,923 INFO L226 Difference]: Without dead ends: 779 [2023-11-22 19:03:37,924 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-11-22 19:03:37,924 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-11-22 19:03:37,924 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-11-22 19:03:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-11-22 19:03:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 687. [2023-11-22 19:03:37,980 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-11-22 19:03:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 933 transitions. [2023-11-22 19:03:37,983 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 933 transitions. Word has length 45 [2023-11-22 19:03:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:37,983 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 933 transitions. [2023-11-22 19:03:37,983 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-11-22 19:03:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 933 transitions. [2023-11-22 19:03:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 19:03:37,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:37,984 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-11-22 19:03:37,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 19:03:37,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:37,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1308162012, now seen corresponding path program 1 times [2023-11-22 19:03:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423306719] [2023-11-22 19:03:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423306719] [2023-11-22 19:03:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423306719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212327853] [2023-11-22 19:03:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:38,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:38,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:38,040 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-11-22 19:03:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:38,148 INFO L93 Difference]: Finished difference Result 1420 states and 1981 transitions. [2023-11-22 19:03:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:38,148 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-11-22 19:03:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:38,152 INFO L225 Difference]: With dead ends: 1420 [2023-11-22 19:03:38,152 INFO L226 Difference]: Without dead ends: 741 [2023-11-22 19:03:38,153 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-11-22 19:03:38,154 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-11-22 19:03:38,154 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-11-22 19:03:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-22 19:03:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 699. [2023-11-22 19:03:38,201 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-11-22 19:03:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 941 transitions. [2023-11-22 19:03:38,205 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 941 transitions. Word has length 45 [2023-11-22 19:03:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:38,205 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 941 transitions. [2023-11-22 19:03:38,205 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-11-22 19:03:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 941 transitions. [2023-11-22 19:03:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 19:03:38,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:38,209 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-11-22 19:03:38,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 19:03:38,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:38,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366950, now seen corresponding path program 1 times [2023-11-22 19:03:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971366816] [2023-11-22 19:03:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971366816] [2023-11-22 19:03:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971366816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:38,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:38,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288717045] [2023-11-22 19:03:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:38,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:38,269 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-11-22 19:03:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:38,429 INFO L93 Difference]: Finished difference Result 1884 states and 2563 transitions. [2023-11-22 19:03:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:38,430 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-11-22 19:03:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:38,434 INFO L225 Difference]: With dead ends: 1884 [2023-11-22 19:03:38,434 INFO L226 Difference]: Without dead ends: 1255 [2023-11-22 19:03:38,435 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-11-22 19:03:38,437 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-11-22 19:03:38,439 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-11-22 19:03:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2023-11-22 19:03:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1172. [2023-11-22 19:03:38,484 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-11-22 19:03:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1576 transitions. [2023-11-22 19:03:38,488 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1576 transitions. Word has length 45 [2023-11-22 19:03:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:38,488 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1576 transitions. [2023-11-22 19:03:38,488 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-11-22 19:03:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1576 transitions. [2023-11-22 19:03:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-22 19:03:38,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:38,489 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-11-22 19:03:38,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 19:03:38,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:38,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash -741508000, now seen corresponding path program 1 times [2023-11-22 19:03:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948641063] [2023-11-22 19:03:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948641063] [2023-11-22 19:03:38,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948641063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:38,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:03:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254579282] [2023-11-22 19:03:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:38,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:38,543 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-11-22 19:03:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:38,740 INFO L93 Difference]: Finished difference Result 2250 states and 3058 transitions. [2023-11-22 19:03:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:03:38,741 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-11-22 19:03:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:38,745 INFO L225 Difference]: With dead ends: 2250 [2023-11-22 19:03:38,745 INFO L226 Difference]: Without dead ends: 1415 [2023-11-22 19:03:38,747 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-11-22 19:03:38,748 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-11-22 19:03:38,748 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-11-22 19:03:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-11-22 19:03:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1317. [2023-11-22 19:03:38,805 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-11-22 19:03:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1767 transitions. [2023-11-22 19:03:38,810 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1767 transitions. Word has length 53 [2023-11-22 19:03:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:38,810 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1767 transitions. [2023-11-22 19:03:38,814 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-11-22 19:03:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1767 transitions. [2023-11-22 19:03:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-22 19:03:38,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:38,815 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-11-22 19:03:38,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 19:03:38,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:38,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1263305305, now seen corresponding path program 1 times [2023-11-22 19:03:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337557130] [2023-11-22 19:03:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337557130] [2023-11-22 19:03:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337557130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 19:03:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853496214] [2023-11-22 19:03:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 19:03:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 19:03:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:03:38,893 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-11-22 19:03:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:39,107 INFO L93 Difference]: Finished difference Result 3271 states and 4430 transitions. [2023-11-22 19:03:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 19:03:39,108 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-11-22 19:03:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:39,115 INFO L225 Difference]: With dead ends: 3271 [2023-11-22 19:03:39,115 INFO L226 Difference]: Without dead ends: 2024 [2023-11-22 19:03:39,118 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-11-22 19:03:39,118 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-11-22 19:03:39,118 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-11-22 19:03:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-11-22 19:03:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1868. [2023-11-22 19:03:39,202 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-11-22 19:03:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2505 transitions. [2023-11-22 19:03:39,208 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2505 transitions. Word has length 56 [2023-11-22 19:03:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:39,208 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2505 transitions. [2023-11-22 19:03:39,208 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-11-22 19:03:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2505 transitions. [2023-11-22 19:03:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-22 19:03:39,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:39,209 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-11-22 19:03:39,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 19:03:39,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:39,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -109102014, now seen corresponding path program 1 times [2023-11-22 19:03:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072688328] [2023-11-22 19:03:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 19:03:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072688328] [2023-11-22 19:03:39,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072688328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297850516] [2023-11-22 19:03:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:39,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:39,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:39,284 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-11-22 19:03:39,289 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-11-22 19:03:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:39,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:39,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297850516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:39,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-22 19:03:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646677400] [2023-11-22 19:03:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:39,389 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-11-22 19:03:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:39,511 INFO L93 Difference]: Finished difference Result 5196 states and 7106 transitions. [2023-11-22 19:03:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:39,512 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-11-22 19:03:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:39,522 INFO L225 Difference]: With dead ends: 5196 [2023-11-22 19:03:39,522 INFO L226 Difference]: Without dead ends: 3337 [2023-11-22 19:03:39,525 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-11-22 19:03:39,525 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-11-22 19:03:39,525 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-11-22 19:03:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2023-11-22 19:03:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3212. [2023-11-22 19:03:39,621 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-11-22 19:03:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4327 transitions. [2023-11-22 19:03:39,631 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4327 transitions. Word has length 61 [2023-11-22 19:03:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:39,632 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 4327 transitions. [2023-11-22 19:03:39,632 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-11-22 19:03:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4327 transitions. [2023-11-22 19:03:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 19:03:39,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:39,633 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-11-22 19:03:39,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 19:03:39,851 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-11-22 19:03:39,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:39,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -376855157, now seen corresponding path program 1 times [2023-11-22 19:03:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849723924] [2023-11-22 19:03:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849723924] [2023-11-22 19:03:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849723924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:03:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233083505] [2023-11-22 19:03:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:39,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:39,923 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-11-22 19:03:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:40,149 INFO L93 Difference]: Finished difference Result 6660 states and 9019 transitions. [2023-11-22 19:03:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:40,150 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-11-22 19:03:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:40,162 INFO L225 Difference]: With dead ends: 6660 [2023-11-22 19:03:40,162 INFO L226 Difference]: Without dead ends: 3461 [2023-11-22 19:03:40,169 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-11-22 19:03:40,170 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-11-22 19:03:40,171 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-11-22 19:03:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2023-11-22 19:03:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3250. [2023-11-22 19:03:40,303 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-11-22 19:03:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4298 transitions. [2023-11-22 19:03:40,313 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4298 transitions. Word has length 62 [2023-11-22 19:03:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:40,314 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 4298 transitions. [2023-11-22 19:03:40,314 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-11-22 19:03:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4298 transitions. [2023-11-22 19:03:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 19:03:40,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:40,315 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-11-22 19:03:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 19:03:40,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:40,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -336180407, now seen corresponding path program 1 times [2023-11-22 19:03:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800618966] [2023-11-22 19:03:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 19:03:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800618966] [2023-11-22 19:03:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800618966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:40,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 19:03:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546432605] [2023-11-22 19:03:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:40,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:03:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:03:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:03:40,347 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-11-22 19:03:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:40,509 INFO L93 Difference]: Finished difference Result 3660 states and 4878 transitions. [2023-11-22 19:03:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:03:40,509 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-11-22 19:03:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:40,520 INFO L225 Difference]: With dead ends: 3660 [2023-11-22 19:03:40,520 INFO L226 Difference]: Without dead ends: 3476 [2023-11-22 19:03:40,522 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-11-22 19:03:40,523 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-11-22 19:03:40,523 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-11-22 19:03:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2023-11-22 19:03:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3187. [2023-11-22 19:03:40,644 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-11-22 19:03:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4218 transitions. [2023-11-22 19:03:40,653 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4218 transitions. Word has length 62 [2023-11-22 19:03:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:40,653 INFO L495 AbstractCegarLoop]: Abstraction has 3187 states and 4218 transitions. [2023-11-22 19:03:40,653 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-11-22 19:03:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4218 transitions. [2023-11-22 19:03:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-22 19:03:40,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:40,654 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-11-22 19:03:40,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 19:03:40,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:40,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash 90638681, now seen corresponding path program 1 times [2023-11-22 19:03:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123158189] [2023-11-22 19:03:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:03:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 19:03:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123158189] [2023-11-22 19:03:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123158189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:03:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61398330] [2023-11-22 19:03:40,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:40,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:40,707 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-11-22 19:03:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:41,174 INFO L93 Difference]: Finished difference Result 9519 states and 12993 transitions. [2023-11-22 19:03:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 19:03:41,175 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-11-22 19:03:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:41,195 INFO L225 Difference]: With dead ends: 9519 [2023-11-22 19:03:41,195 INFO L226 Difference]: Without dead ends: 6176 [2023-11-22 19:03:41,202 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-11-22 19:03:41,203 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-11-22 19:03:41,203 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-11-22 19:03:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2023-11-22 19:03:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6046. [2023-11-22 19:03:41,474 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-11-22 19:03:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 7876 transitions. [2023-11-22 19:03:41,491 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 7876 transitions. Word has length 63 [2023-11-22 19:03:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:41,492 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 7876 transitions. [2023-11-22 19:03:41,492 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-11-22 19:03:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 7876 transitions. [2023-11-22 19:03:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-22 19:03:41,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:41,501 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-11-22 19:03:41,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 19:03:41,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:41,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash 551115313, now seen corresponding path program 1 times [2023-11-22 19:03:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777010664] [2023-11-22 19:03:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:41,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-22 19:03:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 19:03:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-22 19:03:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 19:03:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 19:03:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-22 19:03:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-22 19:03:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777010664] [2023-11-22 19:03:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777010664] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881189511] [2023-11-22 19:03:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:41,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:41,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:41,591 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-11-22 19:03:41,621 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-11-22 19:03:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:41,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 19:03:41,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881189511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-22 19:03:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889176650] [2023-11-22 19:03:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:41,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:41,733 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-11-22 19:03:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:41,965 INFO L93 Difference]: Finished difference Result 10046 states and 13154 transitions. [2023-11-22 19:03:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:41,965 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-11-22 19:03:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:41,979 INFO L225 Difference]: With dead ends: 10046 [2023-11-22 19:03:41,979 INFO L226 Difference]: Without dead ends: 3828 [2023-11-22 19:03:41,993 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-11-22 19:03:41,994 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-11-22 19:03:41,994 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-11-22 19:03:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2023-11-22 19:03:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3824. [2023-11-22 19:03:42,154 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-11-22 19:03:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4904 transitions. [2023-11-22 19:03:42,164 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4904 transitions. Word has length 113 [2023-11-22 19:03:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:42,165 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4904 transitions. [2023-11-22 19:03:42,165 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-11-22 19:03:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4904 transitions. [2023-11-22 19:03:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-22 19:03:42,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:42,168 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-11-22 19:03:42,181 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-11-22 19:03:42,384 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-11-22 19:03:42,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:42,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1763703259, now seen corresponding path program 1 times [2023-11-22 19:03:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357658975] [2023-11-22 19:03:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:03:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 19:03:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 19:03:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:03:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 19:03:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 19:03:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-22 19:03:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:42,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357658975] [2023-11-22 19:03:42,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357658975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656748890] [2023-11-22 19:03:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:42,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:42,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 19:03:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:42,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:42,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:03:42,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656748890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-22 19:03:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665502025] [2023-11-22 19:03:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:42,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:42,616 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-11-22 19:03:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:42,766 INFO L93 Difference]: Finished difference Result 8159 states and 10428 transitions. [2023-11-22 19:03:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:42,767 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-11-22 19:03:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:42,790 INFO L225 Difference]: With dead ends: 8159 [2023-11-22 19:03:42,790 INFO L226 Difference]: Without dead ends: 4632 [2023-11-22 19:03:42,798 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-11-22 19:03:42,799 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-11-22 19:03:42,799 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-11-22 19:03:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2023-11-22 19:03:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2023-11-22 19:03:42,988 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-11-22 19:03:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5844 transitions. [2023-11-22 19:03:42,999 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5844 transitions. Word has length 115 [2023-11-22 19:03:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:43,000 INFO L495 AbstractCegarLoop]: Abstraction has 4632 states and 5844 transitions. [2023-11-22 19:03:43,000 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-11-22 19:03:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5844 transitions. [2023-11-22 19:03:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-22 19:03:43,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:43,003 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-11-22 19:03:43,022 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-11-22 19:03:43,216 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-11-22 19:03:43,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:43,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -607311514, now seen corresponding path program 1 times [2023-11-22 19:03:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891523553] [2023-11-22 19:03:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:03:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 19:03:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 19:03:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 19:03:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-22 19:03:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-22 19:03:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891523553] [2023-11-22 19:03:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891523553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809800771] [2023-11-22 19:03:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:43,313 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-11-22 19:03:43,314 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-11-22 19:03:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:43,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:43,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 19:03:43,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809800771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:43,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 19:03:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545992631] [2023-11-22 19:03:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:43,428 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-11-22 19:03:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:43,678 INFO L93 Difference]: Finished difference Result 12231 states and 15568 transitions. [2023-11-22 19:03:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:43,678 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-11-22 19:03:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:43,696 INFO L225 Difference]: With dead ends: 12231 [2023-11-22 19:03:43,696 INFO L226 Difference]: Without dead ends: 7814 [2023-11-22 19:03:43,707 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-11-22 19:03:43,707 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-11-22 19:03:43,708 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-11-22 19:03:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7814 states. [2023-11-22 19:03:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7814 to 7810. [2023-11-22 19:03:44,048 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-11-22 19:03:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 9686 transitions. [2023-11-22 19:03:44,068 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 9686 transitions. Word has length 135 [2023-11-22 19:03:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:44,069 INFO L495 AbstractCegarLoop]: Abstraction has 7810 states and 9686 transitions. [2023-11-22 19:03:44,069 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-11-22 19:03:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 9686 transitions. [2023-11-22 19:03:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-22 19:03:44,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:44,073 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-11-22 19:03:44,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:44,284 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-11-22 19:03:44,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:44,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash -629943768, now seen corresponding path program 1 times [2023-11-22 19:03:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585213511] [2023-11-22 19:03:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:03:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 19:03:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 19:03:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 19:03:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-22 19:03:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-22 19:03:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585213511] [2023-11-22 19:03:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585213511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402162593] [2023-11-22 19:03:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:44,391 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-11-22 19:03:44,412 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-11-22 19:03:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:44,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:03:44,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 19:03:44,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402162593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-11-22 19:03:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903795039] [2023-11-22 19:03:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:44,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:44,511 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-11-22 19:03:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:44,736 INFO L93 Difference]: Finished difference Result 12624 states and 15700 transitions. [2023-11-22 19:03:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:44,737 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-11-22 19:03:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:44,747 INFO L225 Difference]: With dead ends: 12624 [2023-11-22 19:03:44,748 INFO L226 Difference]: Without dead ends: 4823 [2023-11-22 19:03:44,763 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-11-22 19:03:44,763 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-11-22 19:03:44,764 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-11-22 19:03:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2023-11-22 19:03:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4531. [2023-11-22 19:03:44,915 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-11-22 19:03:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5584 transitions. [2023-11-22 19:03:44,924 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5584 transitions. Word has length 135 [2023-11-22 19:03:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:44,924 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 5584 transitions. [2023-11-22 19:03:44,924 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-11-22 19:03:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5584 transitions. [2023-11-22 19:03:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-22 19:03:44,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:44,927 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-11-22 19:03:44,940 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-11-22 19:03:45,140 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-11-22 19:03:45,141 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:45,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 92477145, now seen corresponding path program 1 times [2023-11-22 19:03:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557426194] [2023-11-22 19:03:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 19:03:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 19:03:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:03:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 19:03:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:03:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 19:03:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-22 19:03:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-22 19:03:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 19:03:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-22 19:03:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557426194] [2023-11-22 19:03:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557426194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 19:03:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167463508] [2023-11-22 19:03:45,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:45,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:03:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:03:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:03:45,238 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-11-22 19:03:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:45,426 INFO L93 Difference]: Finished difference Result 4695 states and 5778 transitions. [2023-11-22 19:03:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:03:45,427 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-11-22 19:03:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:45,435 INFO L225 Difference]: With dead ends: 4695 [2023-11-22 19:03:45,436 INFO L226 Difference]: Without dead ends: 4450 [2023-11-22 19:03:45,437 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-11-22 19:03:45,438 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-22 19:03:45,438 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-11-22 19:03:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2023-11-22 19:03:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4289. [2023-11-22 19:03:45,563 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-11-22 19:03:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 5307 transitions. [2023-11-22 19:03:45,570 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 5307 transitions. Word has length 139 [2023-11-22 19:03:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:45,570 INFO L495 AbstractCegarLoop]: Abstraction has 4289 states and 5307 transitions. [2023-11-22 19:03:45,570 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-11-22 19:03:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 5307 transitions. [2023-11-22 19:03:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-22 19:03:45,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:45,573 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-11-22 19:03:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 19:03:45,573 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:45,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1401567099, now seen corresponding path program 1 times [2023-11-22 19:03:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:45,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347947188] [2023-11-22 19:03:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:03:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 19:03:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 19:03:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-22 19:03:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-22 19:03:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 19:03:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347947188] [2023-11-22 19:03:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347947188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83587129] [2023-11-22 19:03:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:45,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:45,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:45,653 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-11-22 19:03:45,675 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-11-22 19:03:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:45,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:45,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 19:03:45,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:45,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83587129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:45,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:45,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-11-22 19:03:45,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898977452] [2023-11-22 19:03:45,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:45,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:45,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 19:03:45,812 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-11-22 19:03:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:45,922 INFO L93 Difference]: Finished difference Result 8042 states and 9995 transitions. [2023-11-22 19:03:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:45,923 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-11-22 19:03:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:45,931 INFO L225 Difference]: With dead ends: 8042 [2023-11-22 19:03:45,931 INFO L226 Difference]: Without dead ends: 3984 [2023-11-22 19:03:45,938 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-11-22 19:03:45,939 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-11-22 19:03:45,939 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-11-22 19:03:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2023-11-22 19:03:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3984. [2023-11-22 19:03:46,087 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-11-22 19:03:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4943 transitions. [2023-11-22 19:03:46,094 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4943 transitions. Word has length 144 [2023-11-22 19:03:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:46,095 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4943 transitions. [2023-11-22 19:03:46,095 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-11-22 19:03:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4943 transitions. [2023-11-22 19:03:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-22 19:03:46,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:46,097 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-11-22 19:03:46,110 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-11-22 19:03:46,307 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-11-22 19:03:46,308 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:46,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash 151733564, now seen corresponding path program 1 times [2023-11-22 19:03:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326019432] [2023-11-22 19:03:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:03:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 19:03:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 19:03:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-22 19:03:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-22 19:03:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-22 19:03:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326019432] [2023-11-22 19:03:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326019432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574624966] [2023-11-22 19:03:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:46,358 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-11-22 19:03:46,384 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-11-22 19:03:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:46,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 19:03:46,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574624966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-22 19:03:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957451596] [2023-11-22 19:03:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:46,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:46,464 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-11-22 19:03:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:46,582 INFO L93 Difference]: Finished difference Result 7704 states and 9687 transitions. [2023-11-22 19:03:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:46,583 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-11-22 19:03:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:46,591 INFO L225 Difference]: With dead ends: 7704 [2023-11-22 19:03:46,591 INFO L226 Difference]: Without dead ends: 3855 [2023-11-22 19:03:46,596 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-11-22 19:03:46,596 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-11-22 19:03:46,596 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-11-22 19:03:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2023-11-22 19:03:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3852. [2023-11-22 19:03:46,712 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-11-22 19:03:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 4724 transitions. [2023-11-22 19:03:46,718 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 4724 transitions. Word has length 144 [2023-11-22 19:03:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:46,719 INFO L495 AbstractCegarLoop]: Abstraction has 3852 states and 4724 transitions. [2023-11-22 19:03:46,719 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-11-22 19:03:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 4724 transitions. [2023-11-22 19:03:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-22 19:03:46,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:46,721 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-11-22 19:03:46,734 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-11-22 19:03:46,932 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-11-22 19:03:46,932 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:46,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1828873167, now seen corresponding path program 1 times [2023-11-22 19:03:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019790567] [2023-11-22 19:03:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:03:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 19:03:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 19:03:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-22 19:03:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 19:03:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-22 19:03:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-22 19:03:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-22 19:03:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:47,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019790567] [2023-11-22 19:03:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019790567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:03:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20225446] [2023-11-22 19:03:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:47,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:47,007 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-11-22 19:03:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:47,284 INFO L93 Difference]: Finished difference Result 8291 states and 10182 transitions. [2023-11-22 19:03:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:03:47,285 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-11-22 19:03:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:47,292 INFO L225 Difference]: With dead ends: 8291 [2023-11-22 19:03:47,292 INFO L226 Difference]: Without dead ends: 4482 [2023-11-22 19:03:47,295 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-11-22 19:03:47,296 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-11-22 19:03:47,296 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-11-22 19:03:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2023-11-22 19:03:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4253. [2023-11-22 19:03:47,418 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-11-22 19:03:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5201 transitions. [2023-11-22 19:03:47,424 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5201 transitions. Word has length 145 [2023-11-22 19:03:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:47,425 INFO L495 AbstractCegarLoop]: Abstraction has 4253 states and 5201 transitions. [2023-11-22 19:03:47,425 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-11-22 19:03:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5201 transitions. [2023-11-22 19:03:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 19:03:47,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:47,427 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-11-22 19:03:47,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-22 19:03:47,427 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:47,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 525296427, now seen corresponding path program 1 times [2023-11-22 19:03:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437662643] [2023-11-22 19:03:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-22 19:03:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-22 19:03:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-22 19:03:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 19:03:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-22 19:03:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-22 19:03:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437662643] [2023-11-22 19:03:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437662643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682781645] [2023-11-22 19:03:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:47,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:47,480 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-11-22 19:03:47,512 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-11-22 19:03:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:47,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:47,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 19:03:47,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682781645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:47,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:47,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-22 19:03:47,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163547711] [2023-11-22 19:03:47,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:47,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:47,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:47,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:47,613 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-11-22 19:03:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:47,724 INFO L93 Difference]: Finished difference Result 7878 states and 9665 transitions. [2023-11-22 19:03:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:47,724 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-11-22 19:03:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:47,731 INFO L225 Difference]: With dead ends: 7878 [2023-11-22 19:03:47,731 INFO L226 Difference]: Without dead ends: 3705 [2023-11-22 19:03:47,735 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-11-22 19:03:47,735 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-11-22 19:03:47,736 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-11-22 19:03:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2023-11-22 19:03:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3459. [2023-11-22 19:03:47,839 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-11-22 19:03:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4160 transitions. [2023-11-22 19:03:47,844 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4160 transitions. Word has length 150 [2023-11-22 19:03:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:47,845 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4160 transitions. [2023-11-22 19:03:47,845 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-11-22 19:03:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4160 transitions. [2023-11-22 19:03:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 19:03:47,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:47,846 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-11-22 19:03:47,859 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-11-22 19:03:48,062 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-11-22 19:03:48,062 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:48,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 204611596, now seen corresponding path program 1 times [2023-11-22 19:03:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190377335] [2023-11-22 19:03:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-22 19:03:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-22 19:03:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-22 19:03:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 19:03:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-22 19:03:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-22 19:03:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190377335] [2023-11-22 19:03:48,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190377335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411268] [2023-11-22 19:03:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:48,114 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-11-22 19:03:48,115 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-11-22 19:03:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:48,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:03:48,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-22 19:03:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954146047] [2023-11-22 19:03:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:48,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:03:48,221 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-11-22 19:03:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:48,363 INFO L93 Difference]: Finished difference Result 4003 states and 4819 transitions. [2023-11-22 19:03:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:48,364 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-11-22 19:03:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:48,370 INFO L225 Difference]: With dead ends: 4003 [2023-11-22 19:03:48,370 INFO L226 Difference]: Without dead ends: 3462 [2023-11-22 19:03:48,371 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-11-22 19:03:48,372 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-11-22 19:03:48,373 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-11-22 19:03:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2023-11-22 19:03:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3459. [2023-11-22 19:03:48,506 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-11-22 19:03:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4147 transitions. [2023-11-22 19:03:48,511 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4147 transitions. Word has length 150 [2023-11-22 19:03:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:48,513 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4147 transitions. [2023-11-22 19:03:48,513 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-11-22 19:03:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4147 transitions. [2023-11-22 19:03:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-22 19:03:48,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:48,515 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-11-22 19:03:48,530 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-11-22 19:03:48,720 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-11-22 19:03:48,720 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:48,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -538576786, now seen corresponding path program 1 times [2023-11-22 19:03:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588042677] [2023-11-22 19:03:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 19:03:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-22 19:03:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 19:03:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-22 19:03:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-22 19:03:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-22 19:03:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588042677] [2023-11-22 19:03:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588042677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972840903] [2023-11-22 19:03:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:48,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:48,848 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-11-22 19:03:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 19:03:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:48,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 19:03:48,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-22 19:03:49,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:03:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-22 19:03:49,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972840903] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:03:49,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 19:03:49,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 6 [2023-11-22 19:03:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141557087] [2023-11-22 19:03:49,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 19:03:49,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:03:49,152 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-11-22 19:03:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:49,437 INFO L93 Difference]: Finished difference Result 6182 states and 7415 transitions. [2023-11-22 19:03:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:03:49,438 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-11-22 19:03:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:49,447 INFO L225 Difference]: With dead ends: 6182 [2023-11-22 19:03:49,447 INFO L226 Difference]: Without dead ends: 3862 [2023-11-22 19:03:49,450 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-11-22 19:03:49,451 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-11-22 19:03:49,451 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-11-22 19:03:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2023-11-22 19:03:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3714. [2023-11-22 19:03:49,604 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-11-22 19:03:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4441 transitions. [2023-11-22 19:03:49,610 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4441 transitions. Word has length 152 [2023-11-22 19:03:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:49,611 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 4441 transitions. [2023-11-22 19:03:49,611 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-11-22 19:03:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4441 transitions. [2023-11-22 19:03:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-11-22 19:03:49,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:49,615 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-11-22 19:03:49,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-22 19:03:49,828 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-11-22 19:03:49,828 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:49,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2090905181, now seen corresponding path program 1 times [2023-11-22 19:03:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464338342] [2023-11-22 19:03:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 19:03:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-22 19:03:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 19:03:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-22 19:03:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-22 19:03:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-22 19:03:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-22 19:03:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-22 19:03:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-22 19:03:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-22 19:03:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-22 19:03:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-22 19:03:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-22 19:03:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 101 proven. 29 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-11-22 19:03:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464338342] [2023-11-22 19:03:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464338342] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616191690] [2023-11-22 19:03:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:49,938 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-11-22 19:03:49,939 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-11-22 19:03:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:50,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-22 19:03:50,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616191690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:50,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-22 19:03:50,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823349828] [2023-11-22 19:03:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:50,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:03:50,091 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-11-22 19:03:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:50,266 INFO L93 Difference]: Finished difference Result 9349 states and 11210 transitions. [2023-11-22 19:03:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:50,267 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-11-22 19:03:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:50,277 INFO L225 Difference]: With dead ends: 9349 [2023-11-22 19:03:50,277 INFO L226 Difference]: Without dead ends: 5818 [2023-11-22 19:03:50,283 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-11-22 19:03:50,283 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-11-22 19:03:50,284 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-11-22 19:03:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2023-11-22 19:03:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5712. [2023-11-22 19:03:50,489 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-11-22 19:03:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 6779 transitions. [2023-11-22 19:03:50,499 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 6779 transitions. Word has length 223 [2023-11-22 19:03:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:50,500 INFO L495 AbstractCegarLoop]: Abstraction has 5712 states and 6779 transitions. [2023-11-22 19:03:50,500 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-11-22 19:03:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 6779 transitions. [2023-11-22 19:03:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-11-22 19:03:50,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:50,508 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-11-22 19:03:50,521 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-11-22 19:03:50,719 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-11-22 19:03:50,719 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:50,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 337353441, now seen corresponding path program 1 times [2023-11-22 19:03:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632396056] [2023-11-22 19:03:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 19:03:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 19:03:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 19:03:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:03:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 19:03:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-22 19:03:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-22 19:03:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-22 19:03:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-22 19:03:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-22 19:03:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-22 19:03:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-22 19:03:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-22 19:03:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-22 19:03:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-22 19:03:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-22 19:03:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-22 19:03:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-11-22 19:03:50,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632396056] [2023-11-22 19:03:50,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632396056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224737994] [2023-11-22 19:03:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:50,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:50,780 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-11-22 19:03:50,783 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-11-22 19:03:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:50,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:50,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-11-22 19:03:50,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224737994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-11-22 19:03:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576221753] [2023-11-22 19:03:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:50,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:03:50,900 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-11-22 19:03:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:50,982 INFO L93 Difference]: Finished difference Result 7860 states and 9327 transitions. [2023-11-22 19:03:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:50,983 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-11-22 19:03:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:50,987 INFO L225 Difference]: With dead ends: 7860 [2023-11-22 19:03:50,987 INFO L226 Difference]: Without dead ends: 2279 [2023-11-22 19:03:50,991 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-11-22 19:03:50,992 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-11-22 19:03:50,992 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-11-22 19:03:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-11-22 19:03:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2023-11-22 19:03:51,061 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-11-22 19:03:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2627 transitions. [2023-11-22 19:03:51,064 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2627 transitions. Word has length 223 [2023-11-22 19:03:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:51,065 INFO L495 AbstractCegarLoop]: Abstraction has 2279 states and 2627 transitions. [2023-11-22 19:03:51,065 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-11-22 19:03:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2627 transitions. [2023-11-22 19:03:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-22 19:03:51,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:51,068 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-11-22 19:03:51,082 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-11-22 19:03:51,278 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-11-22 19:03:51,279 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:51,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -738756182, now seen corresponding path program 1 times [2023-11-22 19:03:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715468466] [2023-11-22 19:03:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 19:03:51,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 19:03:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 19:03:51,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 19:03:51,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 19:03:51,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 19:03:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-22 19:03:51,353 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-11-22 19:03:51,355 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 19:03:51,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-22 19:03:51,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-22 19:03:51,430 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,433 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-22 19:03:51,436 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-22 19:03:51,437 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:03:51 BoogieIcfgContainer [2023-11-22 19:03:51,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 19:03:51,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 19:03:51,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 19:03:51,471 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 19:03:51,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:03:36" (3/4) ... [2023-11-22 19:03:51,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 19:03:51,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-22 19:03:51,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-22 19:03:51,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-22 19:03:51,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-22 19:03:51,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 19:03:51,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 19:03:51,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 19:03:51,570 INFO L158 Benchmark]: Toolchain (without parser) took 16265.85ms. Allocated memory was 172.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 106.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 444.6MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,570 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 19:03:51,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.44ms. Allocated memory is still 172.0MB. Free memory was 106.5MB in the beginning and 141.4MB in the end (delta: -34.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.08ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,571 INFO L158 Benchmark]: Boogie Preprocessor took 32.09ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,571 INFO L158 Benchmark]: RCFGBuilder took 386.32ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 115.5MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,573 INFO L158 Benchmark]: TraceAbstraction took 15442.20ms. Allocated memory was 172.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 114.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 435.6MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,573 INFO L158 Benchmark]: Witness Printer took 99.22ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-22 19:03:51,581 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.14ms. Allocated memory is still 96.5MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.44ms. Allocated memory is still 172.0MB. Free memory was 106.5MB in the beginning and 141.4MB in the end (delta: -34.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.08ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.09ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.32ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 115.5MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15442.20ms. Allocated memory was 172.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 114.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 435.6MB. Max. memory is 16.1GB. * Witness Printer took 99.22ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 15.3s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3964 SdHoareTripleChecker+Valid, 2.0s 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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2658 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s 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-11-22 19:03:51,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE