./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:15:20,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:15:20,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:15:20,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:15:20,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:15:20,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:15:20,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:15:20,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:15:20,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:15:20,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:15:20,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:15:20,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:15:20,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:15:20,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:15:20,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:15:20,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:15:20,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:15:20,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:15:20,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:15:20,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:15:20,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:15:20,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:15:20,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:15:20,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:15:20,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:15:20,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:15:20,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:15:20,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:15:20,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:15:20,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:15:20,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:15:20,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:15:20,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:20,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:15:20,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:15:20,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:15:20,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:15:20,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:15:20,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:15:20,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:15:20,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:15:20,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:15:20,303 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-clean/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-clean/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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2024-10-11 03:15:20,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:15:20,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:15:20,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:15:20,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:15:20,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:15:20,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-10-11 03:15:21,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:15:22,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:15:22,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-10-11 03:15:22,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f3c1e022/d8f9dcf830d643ff9cdfdf6ad15d2d27/FLAG008e15020 [2024-10-11 03:15:22,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f3c1e022/d8f9dcf830d643ff9cdfdf6ad15d2d27 [2024-10-11 03:15:22,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:15:22,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:15:22,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:22,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:15:22,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:15:22,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82ae9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22, skipping insertion in model container [2024-10-11 03:15:22,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:15:22,611 WARN L248 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/transmitter.01.cil.c[706,719] [2024-10-11 03:15:22,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:22,649 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:15:22,658 WARN L248 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/transmitter.01.cil.c[706,719] [2024-10-11 03:15:22,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:22,687 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:15:22,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22 WrapperNode [2024-10-11 03:15:22,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:22,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:22,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:15:22,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:15:22,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,717 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2024-10-11 03:15:22,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:22,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:15:22,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:15:22,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:15:22,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,742 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-10-11 03:15:22,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:15:22,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:15:22,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:15:22,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:15:22,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (1/1) ... [2024-10-11 03:15:22,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:22,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:15:22,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:15:22,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:15:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:15:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:15:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:15:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:15:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:15:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:15:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:15:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:15:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:15:22,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:15:22,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:15:23,157 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 03:15:23,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:15:23,226 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:15:23,231 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 03:15:23,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:23 BoogieIcfgContainer [2024-10-11 03:15:23,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:15:23,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:15:23,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:15:23,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:15:23,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:15:22" (1/3) ... [2024-10-11 03:15:23,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca3eb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:23, skipping insertion in model container [2024-10-11 03:15:23,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:22" (2/3) ... [2024-10-11 03:15:23,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca3eb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:23, skipping insertion in model container [2024-10-11 03:15:23,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:23" (3/3) ... [2024-10-11 03:15:23,264 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2024-10-11 03:15:23,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:15:23,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:15:23,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:15:23,341 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;@308a44f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:15:23,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:15:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.626865671641791) internal successors, (109), 69 states have internal predecessors, (109), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 03:15:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:23,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:23,351 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] [2024-10-11 03:15:23,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1028028595, now seen corresponding path program 1 times [2024-10-11 03:15:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:23,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314133221] [2024-10-11 03:15:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314133221] [2024-10-11 03:15:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314133221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515850528] [2024-10-11 03:15:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:23,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:23,818 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.626865671641791) internal successors, (109), 69 states have internal predecessors, (109), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:24,644 INFO L93 Difference]: Finished difference Result 313 states and 498 transitions. [2024-10-11 03:15:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:24,664 INFO L225 Difference]: With dead ends: 313 [2024-10-11 03:15:24,664 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 03:15:24,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:15:24,671 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 323 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:24,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 485 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:15:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 03:15:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 163. [2024-10-11 03:15:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 130 states have internal predecessors, (185), 23 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2024-10-11 03:15:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2024-10-11 03:15:24,735 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 48 [2024-10-11 03:15:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:24,735 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2024-10-11 03:15:24,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2024-10-11 03:15:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:24,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:24,738 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] [2024-10-11 03:15:24,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:15:24,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1330703, now seen corresponding path program 1 times [2024-10-11 03:15:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240400725] [2024-10-11 03:15:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240400725] [2024-10-11 03:15:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240400725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100930013] [2024-10-11 03:15:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:24,926 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:25,468 INFO L93 Difference]: Finished difference Result 573 states and 843 transitions. [2024-10-11 03:15:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:25,472 INFO L225 Difference]: With dead ends: 573 [2024-10-11 03:15:25,472 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 03:15:25,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:15:25,474 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 319 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:25,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 420 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:15:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 03:15:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 299. [2024-10-11 03:15:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 237 states have (on average 1.4514767932489452) internal successors, (344), 242 states have internal predecessors, (344), 37 states have call successors, (37), 20 states have call predecessors, (37), 24 states have return successors, (54), 40 states have call predecessors, (54), 37 states have call successors, (54) [2024-10-11 03:15:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 435 transitions. [2024-10-11 03:15:25,508 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 435 transitions. Word has length 48 [2024-10-11 03:15:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:25,508 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 435 transitions. [2024-10-11 03:15:25,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 435 transitions. [2024-10-11 03:15:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:25,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:25,511 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] [2024-10-11 03:15:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:15:25,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 658200819, now seen corresponding path program 1 times [2024-10-11 03:15:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782802091] [2024-10-11 03:15:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782802091] [2024-10-11 03:15:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782802091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:25,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833441918] [2024-10-11 03:15:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:25,611 INFO L87 Difference]: Start difference. First operand 299 states and 435 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:26,070 INFO L93 Difference]: Finished difference Result 793 states and 1155 transitions. [2024-10-11 03:15:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:15:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:26,074 INFO L225 Difference]: With dead ends: 793 [2024-10-11 03:15:26,075 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 03:15:26,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:15:26,080 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 334 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:26,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 349 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:15:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 03:15:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 431. [2024-10-11 03:15:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.4323529411764706) internal successors, (487), 349 states have internal predecessors, (487), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2024-10-11 03:15:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 616 transitions. [2024-10-11 03:15:26,144 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 616 transitions. Word has length 48 [2024-10-11 03:15:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:26,144 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 616 transitions. [2024-10-11 03:15:26,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 616 transitions. [2024-10-11 03:15:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:26,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:26,146 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] [2024-10-11 03:15:26,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:15:26,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1577175442, now seen corresponding path program 1 times [2024-10-11 03:15:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:26,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351925278] [2024-10-11 03:15:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351925278] [2024-10-11 03:15:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351925278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:26,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403538379] [2024-10-11 03:15:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:26,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:26,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:26,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:26,246 INFO L87 Difference]: Start difference. First operand 431 states and 616 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:26,518 INFO L93 Difference]: Finished difference Result 895 states and 1290 transitions. [2024-10-11 03:15:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:26,525 INFO L225 Difference]: With dead ends: 895 [2024-10-11 03:15:26,525 INFO L226 Difference]: Without dead ends: 473 [2024-10-11 03:15:26,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:15:26,527 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 88 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:26,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 281 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:15:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-11 03:15:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 435. [2024-10-11 03:15:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 344 states have (on average 1.4156976744186047) internal successors, (487), 353 states have internal predecessors, (487), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2024-10-11 03:15:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 616 transitions. [2024-10-11 03:15:26,560 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 616 transitions. Word has length 48 [2024-10-11 03:15:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:26,560 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 616 transitions. [2024-10-11 03:15:26,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 616 transitions. [2024-10-11 03:15:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:26,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:26,562 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] [2024-10-11 03:15:26,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:15:26,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1331588460, now seen corresponding path program 1 times [2024-10-11 03:15:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:26,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503045069] [2024-10-11 03:15:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503045069] [2024-10-11 03:15:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503045069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563326066] [2024-10-11 03:15:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:26,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:26,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:26,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:26,635 INFO L87 Difference]: Start difference. First operand 435 states and 616 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:26,898 INFO L93 Difference]: Finished difference Result 915 states and 1308 transitions. [2024-10-11 03:15:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:15:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:26,901 INFO L225 Difference]: With dead ends: 915 [2024-10-11 03:15:26,901 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 03:15:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:26,903 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:26,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 278 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:15:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 03:15:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 447. [2024-10-11 03:15:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 356 states have (on average 1.401685393258427) internal successors, (499), 365 states have internal predecessors, (499), 54 states have call successors, (54), 30 states have call predecessors, (54), 36 states have return successors, (75), 55 states have call predecessors, (75), 54 states have call successors, (75) [2024-10-11 03:15:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2024-10-11 03:15:26,926 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 48 [2024-10-11 03:15:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:26,926 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2024-10-11 03:15:26,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2024-10-11 03:15:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:26,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:26,927 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] [2024-10-11 03:15:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:15:26,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1465601966, now seen corresponding path program 1 times [2024-10-11 03:15:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133640069] [2024-10-11 03:15:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133640069] [2024-10-11 03:15:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133640069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931440859] [2024-10-11 03:15:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:27,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:27,029 INFO L87 Difference]: Start difference. First operand 447 states and 628 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:27,395 INFO L93 Difference]: Finished difference Result 897 states and 1264 transitions. [2024-10-11 03:15:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:15:27,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:27,399 INFO L225 Difference]: With dead ends: 897 [2024-10-11 03:15:27,399 INFO L226 Difference]: Without dead ends: 655 [2024-10-11 03:15:27,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:15:27,401 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 357 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:27,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 267 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:15:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-11 03:15:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 583. [2024-10-11 03:15:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 468 states have (on average 1.3717948717948718) internal successors, (642), 478 states have internal predecessors, (642), 68 states have call successors, (68), 40 states have call predecessors, (68), 46 states have return successors, (83), 68 states have call predecessors, (83), 68 states have call successors, (83) [2024-10-11 03:15:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 793 transitions. [2024-10-11 03:15:27,430 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 793 transitions. Word has length 48 [2024-10-11 03:15:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:27,430 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 793 transitions. [2024-10-11 03:15:27,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 793 transitions. [2024-10-11 03:15:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:27,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:27,431 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] [2024-10-11 03:15:27,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:15:27,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:27,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2011716880, now seen corresponding path program 1 times [2024-10-11 03:15:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:27,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306014290] [2024-10-11 03:15:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:27,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306014290] [2024-10-11 03:15:27,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306014290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:27,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:15:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567861754] [2024-10-11 03:15:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:15:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:15:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:15:27,553 INFO L87 Difference]: Start difference. First operand 583 states and 793 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:28,006 INFO L93 Difference]: Finished difference Result 1008 states and 1369 transitions. [2024-10-11 03:15:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:15:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:28,009 INFO L225 Difference]: With dead ends: 1008 [2024-10-11 03:15:28,009 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 03:15:28,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:15:28,011 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 301 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:28,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 354 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:15:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 03:15:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 511. [2024-10-11 03:15:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 411 states have (on average 1.364963503649635) internal successors, (561), 418 states have internal predecessors, (561), 61 states have call successors, (61), 35 states have call predecessors, (61), 38 states have return successors, (66), 59 states have call predecessors, (66), 61 states have call successors, (66) [2024-10-11 03:15:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 688 transitions. [2024-10-11 03:15:28,041 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 688 transitions. Word has length 48 [2024-10-11 03:15:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:28,041 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 688 transitions. [2024-10-11 03:15:28,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 688 transitions. [2024-10-11 03:15:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:28,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:28,043 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] [2024-10-11 03:15:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:15:28,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 322773138, now seen corresponding path program 1 times [2024-10-11 03:15:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372649524] [2024-10-11 03:15:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372649524] [2024-10-11 03:15:28,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372649524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185130449] [2024-10-11 03:15:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:28,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:28,113 INFO L87 Difference]: Start difference. First operand 511 states and 688 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:28,391 INFO L93 Difference]: Finished difference Result 1573 states and 2148 transitions. [2024-10-11 03:15:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:15:28,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-11 03:15:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:28,396 INFO L225 Difference]: With dead ends: 1573 [2024-10-11 03:15:28,396 INFO L226 Difference]: Without dead ends: 1071 [2024-10-11 03:15:28,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:15:28,398 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 342 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:28,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 230 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:15:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-11 03:15:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 975. [2024-10-11 03:15:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 782 states have (on average 1.3427109974424551) internal successors, (1050), 794 states have internal predecessors, (1050), 115 states have call successors, (115), 70 states have call predecessors, (115), 77 states have return successors, (149), 114 states have call predecessors, (149), 115 states have call successors, (149) [2024-10-11 03:15:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1314 transitions. [2024-10-11 03:15:28,459 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1314 transitions. Word has length 48 [2024-10-11 03:15:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1314 transitions. [2024-10-11 03:15:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1314 transitions. [2024-10-11 03:15:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:15:28,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:28,461 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] [2024-10-11 03:15:28,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:15:28,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:28,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash 749432211, now seen corresponding path program 1 times [2024-10-11 03:15:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814504126] [2024-10-11 03:15:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814504126] [2024-10-11 03:15:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814504126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:15:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101035688] [2024-10-11 03:15:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:28,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:15:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:15:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:15:28,501 INFO L87 Difference]: Start difference. First operand 975 states and 1314 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:28,673 INFO L93 Difference]: Finished difference Result 1809 states and 2412 transitions. [2024-10-11 03:15:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:15:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 03:15:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:28,677 INFO L225 Difference]: With dead ends: 1809 [2024-10-11 03:15:28,677 INFO L226 Difference]: Without dead ends: 843 [2024-10-11 03:15:28,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:15:28,680 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 218 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:28,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 150 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-10-11 03:15:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 760. [2024-10-11 03:15:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.3284789644012944) internal successors, (821), 627 states have internal predecessors, (821), 83 states have call successors, (83), 53 states have call predecessors, (83), 58 states have return successors, (101), 81 states have call predecessors, (101), 83 states have call successors, (101) [2024-10-11 03:15:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1005 transitions. [2024-10-11 03:15:28,716 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1005 transitions. Word has length 49 [2024-10-11 03:15:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1005 transitions. [2024-10-11 03:15:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:15:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1005 transitions. [2024-10-11 03:15:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:15:28,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:28,717 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] [2024-10-11 03:15:28,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:15:28,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash -6529051, now seen corresponding path program 1 times [2024-10-11 03:15:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816427653] [2024-10-11 03:15:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816427653] [2024-10-11 03:15:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816427653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:15:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836901579] [2024-10-11 03:15:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:28,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:15:28,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:15:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:15:28,756 INFO L87 Difference]: Start difference. First operand 760 states and 1005 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:15:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:29,050 INFO L93 Difference]: Finished difference Result 2338 states and 3090 transitions. [2024-10-11 03:15:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:15:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2024-10-11 03:15:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:29,057 INFO L225 Difference]: With dead ends: 2338 [2024-10-11 03:15:29,057 INFO L226 Difference]: Without dead ends: 1586 [2024-10-11 03:15:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:15:29,060 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 272 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:29,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 197 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:15:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-10-11 03:15:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1437. [2024-10-11 03:15:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1158 states have (on average 1.2962003454231434) internal successors, (1501), 1175 states have internal predecessors, (1501), 162 states have call successors, (162), 106 states have call predecessors, (162), 116 states have return successors, (197), 157 states have call predecessors, (197), 162 states have call successors, (197) [2024-10-11 03:15:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1860 transitions. [2024-10-11 03:15:29,144 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1860 transitions. Word has length 50 [2024-10-11 03:15:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:29,145 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1860 transitions. [2024-10-11 03:15:29,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:15:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1860 transitions. [2024-10-11 03:15:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:15:29,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:29,146 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:29,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:15:29,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash -113707821, now seen corresponding path program 1 times [2024-10-11 03:15:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61639338] [2024-10-11 03:15:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:15:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:15:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:15:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:15:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:15:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:15:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61639338] [2024-10-11 03:15:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61639338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:15:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791013383] [2024-10-11 03:15:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:15:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:15:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:15:29,245 INFO L87 Difference]: Start difference. First operand 1437 states and 1860 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 03:15:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:29,861 INFO L93 Difference]: Finished difference Result 4471 states and 5825 transitions. [2024-10-11 03:15:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:15:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2024-10-11 03:15:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:29,872 INFO L225 Difference]: With dead ends: 4471 [2024-10-11 03:15:29,872 INFO L226 Difference]: Without dead ends: 2336 [2024-10-11 03:15:29,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:29,877 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 478 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:29,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 376 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:15:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2024-10-11 03:15:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2170. [2024-10-11 03:15:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1741 states have (on average 1.2820218265364733) internal successors, (2232), 1779 states have internal predecessors, (2232), 241 states have call successors, (241), 159 states have call predecessors, (241), 187 states have return successors, (343), 233 states have call predecessors, (343), 241 states have call successors, (343) [2024-10-11 03:15:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2816 transitions. [2024-10-11 03:15:29,999 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2816 transitions. Word has length 67 [2024-10-11 03:15:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:29,999 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 2816 transitions. [2024-10-11 03:15:29,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 03:15:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2816 transitions. [2024-10-11 03:15:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:15:30,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:30,003 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:15:30,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1200743010, now seen corresponding path program 1 times [2024-10-11 03:15:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832817775] [2024-10-11 03:15:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:15:30,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:15:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:15:30,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:15:30,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:15:30,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:15:30,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:15:30,066 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:30,132 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:15:30,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:15:30 BoogieIcfgContainer [2024-10-11 03:15:30,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:15:30,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:15:30,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:15:30,137 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:15:30,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:23" (3/4) ... [2024-10-11 03:15:30,138 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:15:30,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:15:30,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:15:30,216 INFO L158 Benchmark]: Toolchain (without parser) took 7779.57ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 124.5MB in the beginning and 252.2MB in the end (delta: -127.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:15:30,216 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:15:30,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.39ms. Allocated memory is still 192.9MB. Free memory was 124.2MB in the beginning and 109.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.22ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,217 INFO L158 Benchmark]: Boogie Preprocessor took 43.00ms. Allocated memory is still 192.9MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,217 INFO L158 Benchmark]: RCFGBuilder took 473.86ms. Allocated memory is still 192.9MB. Free memory was 105.6MB in the beginning and 160.8MB in the end (delta: -55.2MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,217 INFO L158 Benchmark]: TraceAbstraction took 6898.24ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 159.8MB in the beginning and 258.5MB in the end (delta: -98.7MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,217 INFO L158 Benchmark]: Witness Printer took 79.77ms. Allocated memory is still 302.0MB. Free memory was 258.5MB in the beginning and 252.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 03:15:30,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.39ms. Allocated memory is still 192.9MB. Free memory was 124.2MB in the beginning and 109.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.22ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.00ms. Allocated memory is still 192.9MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.86ms. Allocated memory is still 192.9MB. Free memory was 105.6MB in the beginning and 160.8MB in the end (delta: -55.2MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6898.24ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 159.8MB in the beginning and 258.5MB in the end (delta: -98.7MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. * Witness Printer took 79.77ms. Allocated memory is still 302.0MB. Free memory was 258.5MB in the beginning and 252.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3230 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3123 mSDsluCounter, 3387 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2398 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4236 IncrementalHoareTripleChecker+Invalid, 4783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 989 mSDtfsCounter, 4236 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2170occurred in iteration=11, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1027 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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-10-11 03:15:30,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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