./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:06:03,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:06:03,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:06:03,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:06:03,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:06:03,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:06:03,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:06:03,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:06:03,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:06:03,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:06:03,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:06:03,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:06:03,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:06:03,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:06:03,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:06:03,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:06:03,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:06:03,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:06:03,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:06:03,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:06:03,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:06:03,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:06:03,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:06:03,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:06:03,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:06:03,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:06:03,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:06:03,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:06:03,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:06:03,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:06:03,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:06:03,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:06:03,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:03,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:06:03,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:06:03,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:06:03,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:06:03,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:06:03,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:06:03,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:06:03,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:06:03,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:06:03,728 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 [2024-11-16 08:06:03,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:06:03,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:06:03,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:06:03,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:06:03,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:06:03,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-16 08:06:05,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:06:05,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:06:05,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-16 08:06:05,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ccc1c833/75659f64bc154856af6a8854d019461d/FLAG0cb020176 [2024-11-16 08:06:05,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ccc1c833/75659f64bc154856af6a8854d019461d [2024-11-16 08:06:05,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:06:05,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:06:05,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:05,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:06:05,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:06:05,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:05" (1/1) ... [2024-11-16 08:06:05,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f954e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:05, skipping insertion in model container [2024-11-16 08:06:05,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:05" (1/1) ... [2024-11-16 08:06:05,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:06:05,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-16 08:06:06,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:06,072 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:06:06,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-16 08:06:06,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:06,138 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:06:06,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06 WrapperNode [2024-11-16 08:06:06,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:06,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:06,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:06:06,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:06:06,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,166 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 254 [2024-11-16 08:06:06,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:06,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:06:06,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:06:06,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:06:06,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,187 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 08:06:06,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:06:06,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:06:06,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:06:06,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:06:06,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (1/1) ... [2024-11-16 08:06:06,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:06,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:06,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 08:06:06,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 08:06:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:06:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-16 08:06:06,255 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-16 08:06:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-16 08:06:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-16 08:06:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-16 08:06:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-16 08:06:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-16 08:06:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-16 08:06:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-16 08:06:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-16 08:06:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:06:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-16 08:06:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-16 08:06:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:06:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:06:06,315 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:06:06,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:06:06,537 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-16 08:06:06,538 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:06:06,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:06:06,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:06:06,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:06 BoogieIcfgContainer [2024-11-16 08:06:06,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:06:06,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:06:06,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:06:06,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:06:06,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:06:05" (1/3) ... [2024-11-16 08:06:06,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb786f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:06, skipping insertion in model container [2024-11-16 08:06:06,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:06" (2/3) ... [2024-11-16 08:06:06,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb786f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:06, skipping insertion in model container [2024-11-16 08:06:06,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:06" (3/3) ... [2024-11-16 08:06:06,557 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-16 08:06:06,570 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:06:06,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:06:06,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:06:06,632 INFO L333 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, 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;@510f9e7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:06:06,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:06:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 102 states have (on average 1.411764705882353) internal successors, (144), 106 states have internal predecessors, (144), 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) [2024-11-16 08:06:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 08:06:06,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:06,647 INFO L215 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] [2024-11-16 08:06:06,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:06,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash -931998223, now seen corresponding path program 1 times [2024-11-16 08:06:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019161392] [2024-11-16 08:06:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:06:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 08:06:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019161392] [2024-11-16 08:06:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019161392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:06:07,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290340011] [2024-11-16 08:06:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:07,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:06:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:06:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:07,030 INFO L87 Difference]: Start difference. First operand has 125 states, 102 states have (on average 1.411764705882353) internal successors, (144), 106 states have internal predecessors, (144), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-16 08:06:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:07,246 INFO L93 Difference]: Finished difference Result 365 states and 517 transitions. [2024-11-16 08:06:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:06:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 56 [2024-11-16 08:06:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:07,258 INFO L225 Difference]: With dead ends: 365 [2024-11-16 08:06:07,258 INFO L226 Difference]: Without dead ends: 240 [2024-11-16 08:06:07,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:07,265 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 328 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:07,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 729 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-16 08:06:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 208. [2024-11-16 08:06:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 174 states have (on average 1.339080459770115) internal successors, (233), 177 states have internal predecessors, (233), 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) [2024-11-16 08:06:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2024-11-16 08:06:07,326 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 56 [2024-11-16 08:06:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:07,326 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2024-11-16 08:06:07,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-16 08:06:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2024-11-16 08:06:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 08:06:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:07,330 INFO L215 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] [2024-11-16 08:06:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:06:07,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1495851212, now seen corresponding path program 1 times [2024-11-16 08:06:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153662400] [2024-11-16 08:06:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:06:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 08:06:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153662400] [2024-11-16 08:06:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153662400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:07,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:07,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293038107] [2024-11-16 08:06:07,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:07,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:07,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:07,460 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-11-16 08:06:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:07,614 INFO L93 Difference]: Finished difference Result 422 states and 567 transitions. [2024-11-16 08:06:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:06:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 56 [2024-11-16 08:06:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:07,616 INFO L225 Difference]: With dead ends: 422 [2024-11-16 08:06:07,616 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 08:06:07,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:07,618 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 38 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:07,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 640 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 08:06:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-16 08:06:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 180 states have internal predecessors, (235), 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) [2024-11-16 08:06:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2024-11-16 08:06:07,634 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 56 [2024-11-16 08:06:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:07,635 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2024-11-16 08:06:07,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-11-16 08:06:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2024-11-16 08:06:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 08:06:07,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:07,637 INFO L215 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] [2024-11-16 08:06:07,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:06:07,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:07,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1166085451, now seen corresponding path program 1 times [2024-11-16 08:06:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112096107] [2024-11-16 08:06:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:06:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 08:06:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112096107] [2024-11-16 08:06:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112096107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:07,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:07,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503062896] [2024-11-16 08:06:07,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:07,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:07,745 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-11-16 08:06:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:08,084 INFO L93 Difference]: Finished difference Result 826 states and 1106 transitions. [2024-11-16 08:06:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:06:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 56 [2024-11-16 08:06:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:08,088 INFO L225 Difference]: With dead ends: 826 [2024-11-16 08:06:08,088 INFO L226 Difference]: Without dead ends: 625 [2024-11-16 08:06:08,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-16 08:06:08,090 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 525 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:08,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 787 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 08:06:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-16 08:06:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 384. [2024-11-16 08:06:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 324 states have (on average 1.3117283950617284) internal successors, (425), 327 states have internal predecessors, (425), 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) [2024-11-16 08:06:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 502 transitions. [2024-11-16 08:06:08,155 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 502 transitions. Word has length 56 [2024-11-16 08:06:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:08,156 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 502 transitions. [2024-11-16 08:06:08,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-11-16 08:06:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 502 transitions. [2024-11-16 08:06:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 08:06:08,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:08,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:08,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:06:08,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:08,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1777429878, now seen corresponding path program 1 times [2024-11-16 08:06:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:08,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547073500] [2024-11-16 08:06:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547073500] [2024-11-16 08:06:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547073500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:06:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088303645] [2024-11-16 08:06:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:06:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:06:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:08,275 INFO L87 Difference]: Start difference. First operand 384 states and 502 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-16 08:06:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:08,509 INFO L93 Difference]: Finished difference Result 1351 states and 1807 transitions. [2024-11-16 08:06:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:06:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-16 08:06:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:08,513 INFO L225 Difference]: With dead ends: 1351 [2024-11-16 08:06:08,513 INFO L226 Difference]: Without dead ends: 977 [2024-11-16 08:06:08,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:08,515 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 322 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:08,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 803 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-16 08:06:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 868. [2024-11-16 08:06:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 730 states have (on average 1.2726027397260273) internal successors, (929), 733 states have internal predecessors, (929), 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) [2024-11-16 08:06:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1114 transitions. [2024-11-16 08:06:08,566 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1114 transitions. Word has length 58 [2024-11-16 08:06:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:08,566 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1114 transitions. [2024-11-16 08:06:08,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-16 08:06:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1114 transitions. [2024-11-16 08:06:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 08:06:08,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:08,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:06:08,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:08,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 276768339, now seen corresponding path program 1 times [2024-11-16 08:06:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332648754] [2024-11-16 08:06:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332648754] [2024-11-16 08:06:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332648754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953890271] [2024-11-16 08:06:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:08,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:08,678 INFO L87 Difference]: Start difference. First operand 868 states and 1114 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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) [2024-11-16 08:06:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:08,919 INFO L93 Difference]: Finished difference Result 1787 states and 2344 transitions. [2024-11-16 08:06:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:06:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-16 08:06:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:08,926 INFO L225 Difference]: With dead ends: 1787 [2024-11-16 08:06:08,926 INFO L226 Difference]: Without dead ends: 929 [2024-11-16 08:06:08,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:08,929 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 38 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:08,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 627 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-16 08:06:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 886. [2024-11-16 08:06:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 748 states have (on average 1.2606951871657754) internal successors, (943), 751 states have internal predecessors, (943), 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) [2024-11-16 08:06:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1128 transitions. [2024-11-16 08:06:08,984 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1128 transitions. Word has length 58 [2024-11-16 08:06:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1128 transitions. [2024-11-16 08:06:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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) [2024-11-16 08:06:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1128 transitions. [2024-11-16 08:06:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 08:06:08,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:08,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:06:08,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1733335502, now seen corresponding path program 1 times [2024-11-16 08:06:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857196133] [2024-11-16 08:06:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:09,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857196133] [2024-11-16 08:06:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857196133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:06:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777002405] [2024-11-16 08:06:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:06:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:06:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:09,059 INFO L87 Difference]: Start difference. First operand 886 states and 1128 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-16 08:06:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:09,284 INFO L93 Difference]: Finished difference Result 2378 states and 3057 transitions. [2024-11-16 08:06:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:06:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-16 08:06:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:09,289 INFO L225 Difference]: With dead ends: 2378 [2024-11-16 08:06:09,289 INFO L226 Difference]: Without dead ends: 1580 [2024-11-16 08:06:09,291 INFO L431 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 [2024-11-16 08:06:09,291 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 185 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:09,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 519 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-16 08:06:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1488. [2024-11-16 08:06:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1259 states have (on average 1.2573471008737094) internal successors, (1583), 1262 states have internal predecessors, (1583), 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) [2024-11-16 08:06:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1892 transitions. [2024-11-16 08:06:09,381 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1892 transitions. Word has length 58 [2024-11-16 08:06:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1892 transitions. [2024-11-16 08:06:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-16 08:06:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1892 transitions. [2024-11-16 08:06:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 08:06:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:09,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:06:09,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1324977727, now seen corresponding path program 1 times [2024-11-16 08:06:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599817609] [2024-11-16 08:06:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599817609] [2024-11-16 08:06:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599817609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192916386] [2024-11-16 08:06:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:09,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:09,485 INFO L87 Difference]: Start difference. First operand 1488 states and 1892 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-11-16 08:06:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:09,750 INFO L93 Difference]: Finished difference Result 2847 states and 3655 transitions. [2024-11-16 08:06:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:06:09,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 70 [2024-11-16 08:06:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:09,756 INFO L225 Difference]: With dead ends: 2847 [2024-11-16 08:06:09,756 INFO L226 Difference]: Without dead ends: 1787 [2024-11-16 08:06:09,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:09,759 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 619 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:09,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 664 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2024-11-16 08:06:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1674. [2024-11-16 08:06:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1419 states have (on average 1.2551092318534178) internal successors, (1781), 1422 states have internal predecessors, (1781), 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) [2024-11-16 08:06:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2124 transitions. [2024-11-16 08:06:09,814 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2124 transitions. Word has length 70 [2024-11-16 08:06:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:09,814 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2124 transitions. [2024-11-16 08:06:09,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-11-16 08:06:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2124 transitions. [2024-11-16 08:06:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-16 08:06:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:09,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:09,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:06:09,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 312381021, now seen corresponding path program 1 times [2024-11-16 08:06:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960776408] [2024-11-16 08:06:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960776408] [2024-11-16 08:06:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960776408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:06:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573403453] [2024-11-16 08:06:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:06:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:06:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:09,911 INFO L87 Difference]: Start difference. First operand 1674 states and 2124 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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) [2024-11-16 08:06:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:10,148 INFO L93 Difference]: Finished difference Result 4141 states and 5300 transitions. [2024-11-16 08:06:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:06:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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 73 [2024-11-16 08:06:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:10,156 INFO L225 Difference]: With dead ends: 4141 [2024-11-16 08:06:10,156 INFO L226 Difference]: Without dead ends: 2555 [2024-11-16 08:06:10,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:06:10,159 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 345 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:10,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 738 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2024-11-16 08:06:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2373. [2024-11-16 08:06:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2014 states have (on average 1.2537239324726912) internal successors, (2525), 2017 states have internal predecessors, (2525), 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) [2024-11-16 08:06:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3010 transitions. [2024-11-16 08:06:10,269 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3010 transitions. Word has length 73 [2024-11-16 08:06:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:10,270 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3010 transitions. [2024-11-16 08:06:10,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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) [2024-11-16 08:06:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3010 transitions. [2024-11-16 08:06:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:06:10,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:10,271 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 08:06:10,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:06:10,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1891214723, now seen corresponding path program 1 times [2024-11-16 08:06:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677654111] [2024-11-16 08:06:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 08:06:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 08:06:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677654111] [2024-11-16 08:06:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677654111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989578398] [2024-11-16 08:06:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:10,321 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) [2024-11-16 08:06:10,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 08:06:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:10,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:06:10,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989578398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:10,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 08:06:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480353881] [2024-11-16 08:06:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:10,410 INFO L87 Difference]: Start difference. First operand 2373 states and 3010 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2024-11-16 08:06:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:10,534 INFO L93 Difference]: Finished difference Result 6553 states and 8463 transitions. [2024-11-16 08:06:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:10,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 79 [2024-11-16 08:06:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:10,547 INFO L225 Difference]: With dead ends: 6553 [2024-11-16 08:06:10,547 INFO L226 Difference]: Without dead ends: 4191 [2024-11-16 08:06:10,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:10,552 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 99 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:10,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 398 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2024-11-16 08:06:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4036. [2024-11-16 08:06:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 3388 states have (on average 1.2384887839433294) internal successors, (4196), 3392 states have internal predecessors, (4196), 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) [2024-11-16 08:06:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5151 transitions. [2024-11-16 08:06:10,714 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5151 transitions. Word has length 79 [2024-11-16 08:06:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:10,714 INFO L471 AbstractCegarLoop]: Abstraction has 4036 states and 5151 transitions. [2024-11-16 08:06:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2024-11-16 08:06:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5151 transitions. [2024-11-16 08:06:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 08:06:10,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:10,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:10,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 08:06:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:10,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1176254194, now seen corresponding path program 1 times [2024-11-16 08:06:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870650872] [2024-11-16 08:06:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 08:06:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870650872] [2024-11-16 08:06:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870650872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:06:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370997396] [2024-11-16 08:06:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:06:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:06:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:10,973 INFO L87 Difference]: Start difference. First operand 4036 states and 5151 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-11-16 08:06:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:11,287 INFO L93 Difference]: Finished difference Result 8343 states and 10702 transitions. [2024-11-16 08:06:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:06:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 82 [2024-11-16 08:06:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:11,301 INFO L225 Difference]: With dead ends: 8343 [2024-11-16 08:06:11,301 INFO L226 Difference]: Without dead ends: 4322 [2024-11-16 08:06:11,308 INFO L431 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 [2024-11-16 08:06:11,309 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:11,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 477 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2024-11-16 08:06:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 4074. [2024-11-16 08:06:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 3407 states have (on average 1.223070149691811) internal successors, (4167), 3430 states have internal predecessors, (4167), 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) [2024-11-16 08:06:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5122 transitions. [2024-11-16 08:06:11,489 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5122 transitions. Word has length 82 [2024-11-16 08:06:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:11,489 INFO L471 AbstractCegarLoop]: Abstraction has 4074 states and 5122 transitions. [2024-11-16 08:06:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-11-16 08:06:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5122 transitions. [2024-11-16 08:06:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 08:06:11,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:11,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:11,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:06:11,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:11,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1619865617, now seen corresponding path program 1 times [2024-11-16 08:06:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280925495] [2024-11-16 08:06:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 08:06:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280925495] [2024-11-16 08:06:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280925495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:06:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696091285] [2024-11-16 08:06:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:06:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:06:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:06:11,522 INFO L87 Difference]: Start difference. First operand 4074 states and 5122 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2024-11-16 08:06:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:11,688 INFO L93 Difference]: Finished difference Result 4563 states and 5781 transitions. [2024-11-16 08:06:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:06:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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 82 [2024-11-16 08:06:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:11,702 INFO L225 Difference]: With dead ends: 4563 [2024-11-16 08:06:11,702 INFO L226 Difference]: Without dead ends: 4336 [2024-11-16 08:06:11,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:11,704 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 190 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:11,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 234 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2024-11-16 08:06:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 3995. [2024-11-16 08:06:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3344 states have (on average 1.2239832535885167) internal successors, (4093), 3366 states have internal predecessors, (4093), 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) [2024-11-16 08:06:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 5026 transitions. [2024-11-16 08:06:11,874 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 5026 transitions. Word has length 82 [2024-11-16 08:06:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:11,874 INFO L471 AbstractCegarLoop]: Abstraction has 3995 states and 5026 transitions. [2024-11-16 08:06:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2024-11-16 08:06:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 5026 transitions. [2024-11-16 08:06:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 08:06:11,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:11,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:06:11,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1615619378, now seen corresponding path program 1 times [2024-11-16 08:06:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448361044] [2024-11-16 08:06:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 08:06:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 08:06:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448361044] [2024-11-16 08:06:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448361044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304636110] [2024-11-16 08:06:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:11,924 INFO L87 Difference]: Start difference. First operand 3995 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-16 08:06:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:12,486 INFO L93 Difference]: Finished difference Result 11841 states and 15315 transitions. [2024-11-16 08:06:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:06:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 83 [2024-11-16 08:06:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:12,515 INFO L225 Difference]: With dead ends: 11841 [2024-11-16 08:06:12,518 INFO L226 Difference]: Without dead ends: 7656 [2024-11-16 08:06:12,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 08:06:12,528 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 700 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:12,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 844 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7656 states. [2024-11-16 08:06:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7656 to 7499. [2024-11-16 08:06:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7499 states, 6221 states have (on average 1.1933772705352836) internal successors, (7424), 6283 states have internal predecessors, (7424), 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) [2024-11-16 08:06:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 9329 transitions. [2024-11-16 08:06:13,049 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 9329 transitions. Word has length 83 [2024-11-16 08:06:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:13,050 INFO L471 AbstractCegarLoop]: Abstraction has 7499 states and 9329 transitions. [2024-11-16 08:06:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-16 08:06:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 9329 transitions. [2024-11-16 08:06:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 08:06:13,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:13,055 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:13,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:06:13,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -673973909, now seen corresponding path program 1 times [2024-11-16 08:06:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843380892] [2024-11-16 08:06:13,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 08:06:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 08:06:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 08:06:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 08:06:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 08:06:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 08:06:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 08:06:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-16 08:06:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843380892] [2024-11-16 08:06:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843380892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032003320] [2024-11-16 08:06:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:13,167 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) [2024-11-16 08:06:13,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 08:06:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:13,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:13,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-16 08:06:13,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032003320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-16 08:06:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854204590] [2024-11-16 08:06:13,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:13,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:13,418 INFO L87 Difference]: Start difference. First operand 7499 states and 9329 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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) [2024-11-16 08:06:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:13,603 INFO L93 Difference]: Finished difference Result 12464 states and 15572 transitions. [2024-11-16 08:06:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 142 [2024-11-16 08:06:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:13,629 INFO L225 Difference]: With dead ends: 12464 [2024-11-16 08:06:13,629 INFO L226 Difference]: Without dead ends: 4741 [2024-11-16 08:06:13,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:13,645 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:13,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2024-11-16 08:06:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4730. [2024-11-16 08:06:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 3922 states have (on average 1.182559918408975) internal successors, (4638), 3958 states have internal predecessors, (4638), 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) [2024-11-16 08:06:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5810 transitions. [2024-11-16 08:06:13,896 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5810 transitions. Word has length 142 [2024-11-16 08:06:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:13,896 INFO L471 AbstractCegarLoop]: Abstraction has 4730 states and 5810 transitions. [2024-11-16 08:06:13,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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) [2024-11-16 08:06:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5810 transitions. [2024-11-16 08:06:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 08:06:13,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:13,899 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:13,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 08:06:14,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 08:06:14,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:14,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1161179086, now seen corresponding path program 1 times [2024-11-16 08:06:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265765601] [2024-11-16 08:06:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 08:06:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 08:06:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:06:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 08:06:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 08:06:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 08:06:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 08:06:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 08:06:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265765601] [2024-11-16 08:06:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265765601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188657024] [2024-11-16 08:06:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:14,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:14,200 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) [2024-11-16 08:06:14,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 08:06:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:14,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:14,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 08:06:14,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188657024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:14,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:14,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-16 08:06:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360110163] [2024-11-16 08:06:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:14,407 INFO L87 Difference]: Start difference. First operand 4730 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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) [2024-11-16 08:06:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:14,603 INFO L93 Difference]: Finished difference Result 10093 states and 12362 transitions. [2024-11-16 08:06:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 146 [2024-11-16 08:06:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:14,616 INFO L225 Difference]: With dead ends: 10093 [2024-11-16 08:06:14,616 INFO L226 Difference]: Without dead ends: 5729 [2024-11-16 08:06:14,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:14,623 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 50 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:14,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 289 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2024-11-16 08:06:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5729. [2024-11-16 08:06:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 4737 states have (on average 1.171416508338611) internal successors, (5549), 4777 states have internal predecessors, (5549), 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) [2024-11-16 08:06:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 6941 transitions. [2024-11-16 08:06:14,920 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 6941 transitions. Word has length 146 [2024-11-16 08:06:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:14,921 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 6941 transitions. [2024-11-16 08:06:14,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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) [2024-11-16 08:06:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 6941 transitions. [2024-11-16 08:06:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 08:06:14,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:14,926 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:14,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 08:06:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:15,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:15,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1667945285, now seen corresponding path program 1 times [2024-11-16 08:06:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377634421] [2024-11-16 08:06:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 08:06:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 08:06:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 08:06:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 08:06:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 08:06:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 08:06:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 08:06:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 08:06:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 08:06:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-16 08:06:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377634421] [2024-11-16 08:06:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377634421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716476729] [2024-11-16 08:06:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:15,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:15,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:15,272 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) [2024-11-16 08:06:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 08:06:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:15,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 08:06:15,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 08:06:15,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716476729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-16 08:06:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666166572] [2024-11-16 08:06:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 08:06:15,417 INFO L87 Difference]: Start difference. First operand 5729 states and 6941 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 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) [2024-11-16 08:06:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:15,636 INFO L93 Difference]: Finished difference Result 9683 states and 11740 transitions. [2024-11-16 08:06:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:06:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 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 169 [2024-11-16 08:06:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:15,654 INFO L225 Difference]: With dead ends: 9683 [2024-11-16 08:06:15,654 INFO L226 Difference]: Without dead ends: 3965 [2024-11-16 08:06:15,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 08:06:15,668 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:15,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2024-11-16 08:06:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2024-11-16 08:06:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3442 states have (on average 1.1763509587449157) internal successors, (4049), 3453 states have internal predecessors, (4049), 293 states have call successors, (293), 182 states have call predecessors, (293), 229 states have return successors, (430), 329 states have call predecessors, (430), 291 states have call successors, (430) [2024-11-16 08:06:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 4772 transitions. [2024-11-16 08:06:15,881 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 4772 transitions. Word has length 169 [2024-11-16 08:06:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:15,881 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 4772 transitions. [2024-11-16 08:06:15,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 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) [2024-11-16 08:06:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 4772 transitions. [2024-11-16 08:06:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 08:06:15,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:15,885 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:15,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 08:06:16,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 08:06:16,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:16,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash -115616732, now seen corresponding path program 1 times [2024-11-16 08:06:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:16,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316303820] [2024-11-16 08:06:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 08:06:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 08:06:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 08:06:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 08:06:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 08:06:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 08:06:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 08:06:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 08:06:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-16 08:06:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316303820] [2024-11-16 08:06:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316303820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:06:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489160288] [2024-11-16 08:06:16,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:16,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:06:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:06:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:06:16,273 INFO L87 Difference]: Start difference. First operand 3965 states and 4772 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 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) [2024-11-16 08:06:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:16,431 INFO L93 Difference]: Finished difference Result 4161 states and 5008 transitions. [2024-11-16 08:06:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:06:16,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 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 176 [2024-11-16 08:06:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:16,443 INFO L225 Difference]: With dead ends: 4161 [2024-11-16 08:06:16,443 INFO L226 Difference]: Without dead ends: 3885 [2024-11-16 08:06:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:16,445 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 96 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:16,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 333 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2024-11-16 08:06:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3693. [2024-11-16 08:06:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3210 states have (on average 1.1800623052959502) internal successors, (3788), 3221 states have internal predecessors, (3788), 270 states have call successors, (270), 167 states have call predecessors, (270), 212 states have return successors, (404), 304 states have call predecessors, (404), 268 states have call successors, (404) [2024-11-16 08:06:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 4462 transitions. [2024-11-16 08:06:16,561 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 4462 transitions. Word has length 176 [2024-11-16 08:06:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 4462 transitions. [2024-11-16 08:06:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 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) [2024-11-16 08:06:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 4462 transitions. [2024-11-16 08:06:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 08:06:16,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:16,565 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:06:16,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1999580500, now seen corresponding path program 1 times [2024-11-16 08:06:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599063511] [2024-11-16 08:06:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 08:06:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 08:06:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 08:06:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 08:06:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:06:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 08:06:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 08:06:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 08:06:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 08:06:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-16 08:06:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599063511] [2024-11-16 08:06:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599063511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151587264] [2024-11-16 08:06:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:16,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:16,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:16,637 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) [2024-11-16 08:06:16,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 08:06:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:16,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:16,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 08:06:16,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151587264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2024-11-16 08:06:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623846772] [2024-11-16 08:06:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:16,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:16,814 INFO L87 Difference]: Start difference. First operand 3693 states and 4462 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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) [2024-11-16 08:06:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:16,899 INFO L93 Difference]: Finished difference Result 6966 states and 8456 transitions. [2024-11-16 08:06:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 183 [2024-11-16 08:06:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:16,914 INFO L225 Difference]: With dead ends: 6966 [2024-11-16 08:06:16,915 INFO L226 Difference]: Without dead ends: 3439 [2024-11-16 08:06:16,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:16,922 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:16,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 282 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2024-11-16 08:06:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 3439. [2024-11-16 08:06:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3001 states have (on average 1.1826057980673108) internal successors, (3549), 3012 states have internal predecessors, (3549), 244 states have call successors, (244), 151 states have call predecessors, (244), 193 states have return successors, (372), 275 states have call predecessors, (372), 242 states have call successors, (372) [2024-11-16 08:06:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4165 transitions. [2024-11-16 08:06:17,077 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4165 transitions. Word has length 183 [2024-11-16 08:06:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:17,077 INFO L471 AbstractCegarLoop]: Abstraction has 3439 states and 4165 transitions. [2024-11-16 08:06:17,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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) [2024-11-16 08:06:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4165 transitions. [2024-11-16 08:06:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 08:06:17,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:17,081 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:17,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 08:06:17,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-16 08:06:17,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:17,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -801909555, now seen corresponding path program 1 times [2024-11-16 08:06:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101318045] [2024-11-16 08:06:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 08:06:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 08:06:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 08:06:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 08:06:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:06:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 08:06:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 08:06:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 08:06:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 08:06:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-16 08:06:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101318045] [2024-11-16 08:06:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101318045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280149008] [2024-11-16 08:06:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:17,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:17,372 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) [2024-11-16 08:06:17,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 08:06:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:17,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:06:17,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 08:06:17,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280149008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-16 08:06:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216255204] [2024-11-16 08:06:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:17,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:17,499 INFO L87 Difference]: Start difference. First operand 3439 states and 4165 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2024-11-16 08:06:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:17,598 INFO L93 Difference]: Finished difference Result 6689 states and 8192 transitions. [2024-11-16 08:06:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 183 [2024-11-16 08:06:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:17,637 INFO L225 Difference]: With dead ends: 6689 [2024-11-16 08:06:17,637 INFO L226 Difference]: Without dead ends: 3426 [2024-11-16 08:06:17,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:17,640 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 94 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:17,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 330 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-11-16 08:06:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3422. [2024-11-16 08:06:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2984 states have (on average 1.1625335120643432) internal successors, (3469), 2995 states have internal predecessors, (3469), 244 states have call successors, (244), 151 states have call predecessors, (244), 193 states have return successors, (372), 275 states have call predecessors, (372), 242 states have call successors, (372) [2024-11-16 08:06:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4085 transitions. [2024-11-16 08:06:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4085 transitions. Word has length 183 [2024-11-16 08:06:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:17,734 INFO L471 AbstractCegarLoop]: Abstraction has 3422 states and 4085 transitions. [2024-11-16 08:06:17,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2024-11-16 08:06:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4085 transitions. [2024-11-16 08:06:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 08:06:17,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:17,737 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:17,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 08:06:17,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-16 08:06:17,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -250972528, now seen corresponding path program 1 times [2024-11-16 08:06:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12545312] [2024-11-16 08:06:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 08:06:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 08:06:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 08:06:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 08:06:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 08:06:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 08:06:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 08:06:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 08:06:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-16 08:06:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-16 08:06:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12545312] [2024-11-16 08:06:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12545312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414918812] [2024-11-16 08:06:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:18,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:18,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:18,034 INFO L87 Difference]: Start difference. First operand 3422 states and 4085 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-11-16 08:06:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:18,269 INFO L93 Difference]: Finished difference Result 7352 states and 8804 transitions. [2024-11-16 08:06:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:06:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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 184 [2024-11-16 08:06:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:18,280 INFO L225 Difference]: With dead ends: 7352 [2024-11-16 08:06:18,281 INFO L226 Difference]: Without dead ends: 4076 [2024-11-16 08:06:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:06:18,285 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 153 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 718 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2024-11-16 08:06:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3774. [2024-11-16 08:06:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3292 states have (on average 1.1619076549210205) internal successors, (3825), 3307 states have internal predecessors, (3825), 267 states have call successors, (267), 165 states have call predecessors, (267), 214 states have return successors, (407), 301 states have call predecessors, (407), 265 states have call successors, (407) [2024-11-16 08:06:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 4499 transitions. [2024-11-16 08:06:18,401 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 4499 transitions. Word has length 184 [2024-11-16 08:06:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 3774 states and 4499 transitions. [2024-11-16 08:06:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-11-16 08:06:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 4499 transitions. [2024-11-16 08:06:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 08:06:18,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:18,404 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 08:06:18,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1372422129, now seen corresponding path program 1 times [2024-11-16 08:06:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694219507] [2024-11-16 08:06:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:06:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:06:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-16 08:06:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 08:06:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 08:06:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:06:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 08:06:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-16 08:06:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:18,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694219507] [2024-11-16 08:06:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694219507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:18,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572978136] [2024-11-16 08:06:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:18,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:18,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:18,463 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) [2024-11-16 08:06:18,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 08:06:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:18,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:18,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 08:06:18,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572978136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 08:06:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333704059] [2024-11-16 08:06:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:18,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:18,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:18,624 INFO L87 Difference]: Start difference. First operand 3774 states and 4499 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2024-11-16 08:06:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:18,722 INFO L93 Difference]: Finished difference Result 6914 states and 8274 transitions. [2024-11-16 08:06:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 191 [2024-11-16 08:06:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:18,733 INFO L225 Difference]: With dead ends: 6914 [2024-11-16 08:06:18,733 INFO L226 Difference]: Without dead ends: 3308 [2024-11-16 08:06:18,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:18,738 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 65 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:18,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 310 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2024-11-16 08:06:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3116. [2024-11-16 08:06:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2729 states have (on average 1.157566874312935) internal successors, (3159), 2740 states have internal predecessors, (3159), 214 states have call successors, (214), 132 states have call predecessors, (214), 172 states have return successors, (292), 243 states have call predecessors, (292), 212 states have call successors, (292) [2024-11-16 08:06:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 3665 transitions. [2024-11-16 08:06:18,891 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 3665 transitions. Word has length 191 [2024-11-16 08:06:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:18,891 INFO L471 AbstractCegarLoop]: Abstraction has 3116 states and 3665 transitions. [2024-11-16 08:06:18,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2024-11-16 08:06:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 3665 transitions. [2024-11-16 08:06:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 08:06:18,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:18,894 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:18,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 08:06:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:19,095 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1514176459, now seen corresponding path program 1 times [2024-11-16 08:06:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62349862] [2024-11-16 08:06:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:06:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:06:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-16 08:06:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 08:06:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 08:06:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:06:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 08:06:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-16 08:06:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62349862] [2024-11-16 08:06:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62349862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189626919] [2024-11-16 08:06:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:19,151 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) [2024-11-16 08:06:19,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 08:06:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:06:19,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-16 08:06:19,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189626919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-16 08:06:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131650898] [2024-11-16 08:06:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:19,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:19,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:19,301 INFO L87 Difference]: Start difference. First operand 3116 states and 3665 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2024-11-16 08:06:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:19,380 INFO L93 Difference]: Finished difference Result 3561 states and 4193 transitions. [2024-11-16 08:06:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:19,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 191 [2024-11-16 08:06:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:19,389 INFO L225 Difference]: With dead ends: 3561 [2024-11-16 08:06:19,389 INFO L226 Difference]: Without dead ends: 3120 [2024-11-16 08:06:19,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:06:19,390 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 55 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:19,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 371 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-11-16 08:06:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3116. [2024-11-16 08:06:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2729 states have (on average 1.1542689629901062) internal successors, (3150), 2740 states have internal predecessors, (3150), 214 states have call successors, (214), 132 states have call predecessors, (214), 172 states have return successors, (292), 243 states have call predecessors, (292), 212 states have call successors, (292) [2024-11-16 08:06:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 3656 transitions. [2024-11-16 08:06:19,482 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 3656 transitions. Word has length 191 [2024-11-16 08:06:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:19,482 INFO L471 AbstractCegarLoop]: Abstraction has 3116 states and 3656 transitions. [2024-11-16 08:06:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2024-11-16 08:06:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 3656 transitions. [2024-11-16 08:06:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-16 08:06:19,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:19,485 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:19,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-16 08:06:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-16 08:06:19,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1541645927, now seen corresponding path program 1 times [2024-11-16 08:06:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693170114] [2024-11-16 08:06:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:06:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:06:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 08:06:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:06:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 08:06:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 08:06:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 08:06:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-16 08:06:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693170114] [2024-11-16 08:06:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693170114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453119479] [2024-11-16 08:06:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:19,800 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) [2024-11-16 08:06:19,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 08:06:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:19,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 08:06:19,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 08:06:20,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:06:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-16 08:06:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453119479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:06:20,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:06:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-16 08:06:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575616053] [2024-11-16 08:06:20,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:06:20,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:20,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:20,211 INFO L87 Difference]: Start difference. First operand 3116 states and 3656 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 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) [2024-11-16 08:06:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:20,511 INFO L93 Difference]: Finished difference Result 5511 states and 6475 transitions. [2024-11-16 08:06:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 08:06:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 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 193 [2024-11-16 08:06:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:20,522 INFO L225 Difference]: With dead ends: 5511 [2024-11-16 08:06:20,522 INFO L226 Difference]: Without dead ends: 3506 [2024-11-16 08:06:20,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:20,527 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 202 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:20,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 814 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2024-11-16 08:06:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3313. [2024-11-16 08:06:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2900 states have (on average 1.1524137931034484) internal successors, (3342), 2911 states have internal predecessors, (3342), 229 states have call successors, (229), 141 states have call predecessors, (229), 183 states have return successors, (310), 260 states have call predecessors, (310), 227 states have call successors, (310) [2024-11-16 08:06:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 3881 transitions. [2024-11-16 08:06:20,635 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 3881 transitions. Word has length 193 [2024-11-16 08:06:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:20,668 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 3881 transitions. [2024-11-16 08:06:20,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 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) [2024-11-16 08:06:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 3881 transitions. [2024-11-16 08:06:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-16 08:06:20,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:20,675 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 08:06:20,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-16 08:06:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:20,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:20,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -368415639, now seen corresponding path program 1 times [2024-11-16 08:06:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006695166] [2024-11-16 08:06:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:06:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:06:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 08:06:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:06:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 08:06:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 08:06:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 08:06:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-16 08:06:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-16 08:06:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 08:06:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-16 08:06:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-16 08:06:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 08:06:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 08:06:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 08:06:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 137 proven. 41 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-16 08:06:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006695166] [2024-11-16 08:06:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006695166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738223489] [2024-11-16 08:06:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:21,006 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) [2024-11-16 08:06:21,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 08:06:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:21,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 08:06:21,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-16 08:06:21,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738223489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-16 08:06:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313337194] [2024-11-16 08:06:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:21,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:21,207 INFO L87 Difference]: Start difference. First operand 3313 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2024-11-16 08:06:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:21,455 INFO L93 Difference]: Finished difference Result 8390 states and 9844 transitions. [2024-11-16 08:06:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 282 [2024-11-16 08:06:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:21,470 INFO L225 Difference]: With dead ends: 8390 [2024-11-16 08:06:21,470 INFO L226 Difference]: Without dead ends: 5310 [2024-11-16 08:06:21,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:21,475 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 68 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:21,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 379 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2024-11-16 08:06:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5240. [2024-11-16 08:06:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 4592 states have (on average 1.1467770034843205) internal successors, (5266), 4603 states have internal predecessors, (5266), 372 states have call successors, (372), 226 states have call predecessors, (372), 275 states have return successors, (464), 410 states have call predecessors, (464), 370 states have call successors, (464) [2024-11-16 08:06:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 6102 transitions. [2024-11-16 08:06:21,749 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 6102 transitions. Word has length 282 [2024-11-16 08:06:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:21,749 INFO L471 AbstractCegarLoop]: Abstraction has 5240 states and 6102 transitions. [2024-11-16 08:06:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2024-11-16 08:06:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 6102 transitions. [2024-11-16 08:06:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-16 08:06:21,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:21,757 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 08:06:21,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 08:06:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-16 08:06:21,962 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:21,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash -640851926, now seen corresponding path program 1 times [2024-11-16 08:06:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:21,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063400117] [2024-11-16 08:06:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:06:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:06:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:06:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:06:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 08:06:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 08:06:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:06:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:06:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:06:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 08:06:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 08:06:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:06:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 08:06:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 08:06:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 08:06:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-16 08:06:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-16 08:06:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 08:06:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-16 08:06:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-16 08:06:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 08:06:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 08:06:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 08:06:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 118 proven. 13 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-16 08:06:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063400117] [2024-11-16 08:06:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063400117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996915294] [2024-11-16 08:06:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:22,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:22,063 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) [2024-11-16 08:06:22,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-16 08:06:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:06:22,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-16 08:06:22,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996915294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-16 08:06:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385659944] [2024-11-16 08:06:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:06:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:06:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:06:22,214 INFO L87 Difference]: Start difference. First operand 5240 states and 6102 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) [2024-11-16 08:06:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:22,346 INFO L93 Difference]: Finished difference Result 7390 states and 8617 transitions. [2024-11-16 08:06:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:06:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 282 [2024-11-16 08:06:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:22,358 INFO L225 Difference]: With dead ends: 7390 [2024-11-16 08:06:22,358 INFO L226 Difference]: Without dead ends: 2318 [2024-11-16 08:06:22,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:06:22,365 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 8 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:22,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-16 08:06:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2024-11-16 08:06:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2022 states have (on average 1.1261127596439169) internal successors, (2277), 2035 states have internal predecessors, (2277), 157 states have call successors, (157), 107 states have call predecessors, (157), 138 states have return successors, (197), 175 states have call predecessors, (197), 155 states have call successors, (197) [2024-11-16 08:06:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2631 transitions. [2024-11-16 08:06:22,494 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2631 transitions. Word has length 282 [2024-11-16 08:06:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2631 transitions. [2024-11-16 08:06:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) [2024-11-16 08:06:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2631 transitions. [2024-11-16 08:06:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-16 08:06:22,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:22,500 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 08:06:22,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-16 08:06:22,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-16 08:06:22,701 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash 909002883, now seen corresponding path program 1 times [2024-11-16 08:06:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373383436] [2024-11-16 08:06:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:06:22,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:06:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:06:22,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:06:22,801 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:06:22,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:06:22,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 08:06:22,806 INFO L407 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] [2024-11-16 08:06:22,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:06:22,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:06:22 BoogieIcfgContainer [2024-11-16 08:06:22,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:06:22,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:06:22,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:06:22,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:06:22,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:06" (3/4) ... [2024-11-16 08:06:22,949 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:06:23,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:06:23,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:06:23,045 INFO L158 Benchmark]: Toolchain (without parser) took 17236.88ms. Allocated memory was 167.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 94.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 816.7MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:06:23,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.04ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 94.1MB in the beginning and 225.4MB in the end (delta: -131.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.87ms. Allocated memory is still 253.8MB. Free memory was 225.4MB in the beginning and 223.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,046 INFO L158 Benchmark]: Boogie Preprocessor took 27.90ms. Allocated memory is still 253.8MB. Free memory was 223.3MB in the beginning and 220.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,047 INFO L158 Benchmark]: IcfgBuilder took 352.40ms. Allocated memory is still 253.8MB. Free memory was 220.9MB in the beginning and 199.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,047 INFO L158 Benchmark]: TraceAbstraction took 16395.35ms. Allocated memory was 253.8MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 198.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 807.0MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,047 INFO L158 Benchmark]: Witness Printer took 97.35ms. Allocated memory is still 2.2GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 08:06:23,048 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.15ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.04ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 94.1MB in the beginning and 225.4MB in the end (delta: -131.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.87ms. Allocated memory is still 253.8MB. Free memory was 225.4MB in the beginning and 223.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.90ms. Allocated memory is still 253.8MB. Free memory was 223.3MB in the beginning and 220.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 352.40ms. Allocated memory is still 253.8MB. Free memory was 220.9MB in the beginning and 199.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16395.35ms. Allocated memory was 253.8MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 198.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 807.0MB. Max. memory is 16.1GB. * Witness Printer took 97.35ms. Allocated memory is still 2.2GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * 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 ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, timer=0] [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 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] [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, 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, 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, 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); 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, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [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] [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); 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, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [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] [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, 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, max_loop=2, num=0, timer=0] [L445] 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] [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); 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, \result=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [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] [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] [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] [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); 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, \result=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [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] [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] [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 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] [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, data_0=65, data_1=0, e=0, i=1, 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] [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] [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); 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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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] [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, 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, 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, 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, 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); 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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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); 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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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, 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, 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); 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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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, 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 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, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=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); 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, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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); 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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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, max_loop=2, num=1, timer=1] [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); 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, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [L427] return (__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, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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, max_loop=2, num=1, timer=1] [L445] 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] [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); 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, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [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] [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 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] [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, 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, data_0=65, data_1=65, e=0, i=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] [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] [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); 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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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] [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, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, timer=1] [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); 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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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); 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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, timer=1] [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); 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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, 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 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, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=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); 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, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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); 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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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, max_loop=2, num=2, timer=1] [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); 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, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [L427] return (__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, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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, max_loop=2, num=2, timer=1] [L445] 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] [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); 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, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [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] [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 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] [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, 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, c=65, data_0=65, data_1=65, e=0, i=1, 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, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4563 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4454 mSDsluCounter, 12457 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7760 mSDsCounter, 584 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2458 IncrementalHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 584 mSolverCounterUnsat, 4697 mSDtfsCounter, 2458 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2910 GetRequests, 2777 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7499occurred in iteration=12, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 2694 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5480 NumberOfCodeBlocks, 5480 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5331 ConstructedInterpolants, 0 QuantifiedInterpolants, 9123 SizeOfPredicates, 1 NumberOfNonLiveVariables, 5165 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 4394/4687 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! [2024-11-16 08:06:23,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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