./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/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:54:10,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:54:10,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:54:10,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:54:10,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:54:10,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:54:10,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:54:10,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:54:10,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:54:10,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:54:10,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:54:10,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:54:10,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:54:10,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:54:10,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:54:10,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:54:10,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:54:10,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:54:10,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:54:10,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:54:10,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:54:10,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:54:10,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:54:10,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:54:10,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:54:10,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:54:10,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:54:10,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:54:10,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:54:10,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:54:10,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:54:10,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:54:10,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:10,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:54:10,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:54:10,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:54:10,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:54:10,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:54:10,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:54:10,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:54:10,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:54:10,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:54:10,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2024-10-12 19:54:10,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:54:10,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:54:10,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:54:10,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:54:10,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:54:10,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-10-12 19:54:11,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:54:12,091 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:54:12,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-10-12 19:54:12,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196591a96/c4d3e9d08d86465d8c6e431b2c9adcf0/FLAGf1b254a6d [2024-10-12 19:54:12,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196591a96/c4d3e9d08d86465d8c6e431b2c9adcf0 [2024-10-12 19:54:12,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:54:12,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:54:12,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:12,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:54:12,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:54:12,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fde3b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12, skipping insertion in model container [2024-10-12 19:54:12,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:54:12,309 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/pc_sfifo_1.cil-2.c[642,655] [2024-10-12 19:54:12,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:12,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:54:12,376 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/pc_sfifo_1.cil-2.c[642,655] [2024-10-12 19:54:12,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:12,411 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:54:12,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12 WrapperNode [2024-10-12 19:54:12,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:12,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:12,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:54:12,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:54:12,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,452 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2024-10-12 19:54:12,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:12,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:54:12,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:54:12,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:54:12,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,484 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-12 19:54:12,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:54:12,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:54:12,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:54:12,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:54:12,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (1/1) ... [2024-10-12 19:54:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:12,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:12,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:54:12,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:54:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:54:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:54:12,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:54:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:54:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 19:54:12,586 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 19:54:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 19:54:12,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 19:54:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:54:12,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:54:12,682 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:54:12,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:54:12,953 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-12 19:54:12,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:54:13,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:54:13,005 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 19:54:13,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:13 BoogieIcfgContainer [2024-10-12 19:54:13,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:54:13,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:54:13,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:54:13,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:54:13,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:54:12" (1/3) ... [2024-10-12 19:54:13,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e228166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:13, skipping insertion in model container [2024-10-12 19:54:13,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:12" (2/3) ... [2024-10-12 19:54:13,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e228166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:13, skipping insertion in model container [2024-10-12 19:54:13,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:13" (3/3) ... [2024-10-12 19:54:13,015 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-10-12 19:54:13,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:54:13,032 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:54:13,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:54:13,102 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;@52daf63e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:54:13,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:54:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 55 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 19:54:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 19:54:13,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:13,113 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] [2024-10-12 19:54:13,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1465784770, now seen corresponding path program 1 times [2024-10-12 19:54:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311046692] [2024-10-12 19:54:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,401 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-12 19:54:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311046692] [2024-10-12 19:54:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311046692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:13,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104194439] [2024-10-12 19:54:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:13,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:13,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:13,447 INFO L87 Difference]: Start difference. First operand has 63 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 55 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:13,662 INFO L93 Difference]: Finished difference Result 186 states and 297 transitions. [2024-10-12 19:54:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-10-12 19:54:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:13,673 INFO L225 Difference]: With dead ends: 186 [2024-10-12 19:54:13,673 INFO L226 Difference]: Without dead ends: 123 [2024-10-12 19:54:13,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:13,679 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 91 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:13,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 212 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-12 19:54:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2024-10-12 19:54:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 103 states have internal predecessors, (145), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-12 19:54:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-10-12 19:54:13,729 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 36 [2024-10-12 19:54:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-10-12 19:54:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-10-12 19:54:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:54:13,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:13,734 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] [2024-10-12 19:54:13,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:54:13,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 76557616, now seen corresponding path program 1 times [2024-10-12 19:54:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053813204] [2024-10-12 19:54:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:54:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:13,871 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-12 19:54:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053813204] [2024-10-12 19:54:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053813204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874586181] [2024-10-12 19:54:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:13,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:13,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:13,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:13,880 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:14,060 INFO L93 Difference]: Finished difference Result 351 states and 513 transitions. [2024-10-12 19:54:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-12 19:54:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:14,064 INFO L225 Difference]: With dead ends: 351 [2024-10-12 19:54:14,064 INFO L226 Difference]: Without dead ends: 240 [2024-10-12 19:54:14,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:14,066 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:14,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 189 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-12 19:54:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2024-10-12 19:54:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 188 states have (on average 1.398936170212766) internal successors, (263), 191 states have internal predecessors, (263), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) [2024-10-12 19:54:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 309 transitions. [2024-10-12 19:54:14,116 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 309 transitions. Word has length 37 [2024-10-12 19:54:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:14,116 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 309 transitions. [2024-10-12 19:54:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 309 transitions. [2024-10-12 19:54:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:54:14,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:14,120 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] [2024-10-12 19:54:14,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:54:14,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:14,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1856672701, now seen corresponding path program 1 times [2024-10-12 19:54:14,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:14,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174797165] [2024-10-12 19:54:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:54:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,197 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-12 19:54:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174797165] [2024-10-12 19:54:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174797165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403841260] [2024-10-12 19:54:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:14,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:14,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:14,200 INFO L87 Difference]: Start difference. First operand 217 states and 309 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:14,344 INFO L93 Difference]: Finished difference Result 637 states and 890 transitions. [2024-10-12 19:54:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-12 19:54:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:14,352 INFO L225 Difference]: With dead ends: 637 [2024-10-12 19:54:14,353 INFO L226 Difference]: Without dead ends: 426 [2024-10-12 19:54:14,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:14,358 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 91 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:14,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 225 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-12 19:54:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 322. [2024-10-12 19:54:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.395017793594306) internal successors, (392), 286 states have internal predecessors, (392), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2024-10-12 19:54:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions. [2024-10-12 19:54:14,399 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 38 [2024-10-12 19:54:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:14,399 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 450 transitions. [2024-10-12 19:54:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:54:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions. [2024-10-12 19:54:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:54:14,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:14,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:54:14,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2006311882, now seen corresponding path program 1 times [2024-10-12 19:54:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210686830] [2024-10-12 19:54:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:54:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:54:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:54:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210686830] [2024-10-12 19:54:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210686830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:14,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870843145] [2024-10-12 19:54:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:14,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:14,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:14,511 INFO L87 Difference]: Start difference. First operand 322 states and 450 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:54:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:14,653 INFO L93 Difference]: Finished difference Result 838 states and 1167 transitions. [2024-10-12 19:54:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2024-10-12 19:54:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:14,662 INFO L225 Difference]: With dead ends: 838 [2024-10-12 19:54:14,663 INFO L226 Difference]: Without dead ends: 522 [2024-10-12 19:54:14,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:14,665 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 76 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:14,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 269 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-12 19:54:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 488. [2024-10-12 19:54:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.342789598108747) internal successors, (568), 430 states have internal predecessors, (568), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2024-10-12 19:54:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 664 transitions. [2024-10-12 19:54:14,734 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 664 transitions. Word has length 53 [2024-10-12 19:54:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 664 transitions. [2024-10-12 19:54:14,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:54:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 664 transitions. [2024-10-12 19:54:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:54:14,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:14,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:54:14,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash -6908331, now seen corresponding path program 1 times [2024-10-12 19:54:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016855258] [2024-10-12 19:54:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:54:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:54:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016855258] [2024-10-12 19:54:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016855258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:14,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077951038] [2024-10-12 19:54:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:14,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:14,904 INFO L87 Difference]: Start difference. First operand 488 states and 664 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:15,042 INFO L93 Difference]: Finished difference Result 1067 states and 1443 transitions. [2024-10-12 19:54:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2024-10-12 19:54:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:15,048 INFO L225 Difference]: With dead ends: 1067 [2024-10-12 19:54:15,048 INFO L226 Difference]: Without dead ends: 665 [2024-10-12 19:54:15,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:15,052 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:15,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 201 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-10-12 19:54:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 616. [2024-10-12 19:54:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 535 states have (on average 1.314018691588785) internal successors, (703), 544 states have internal predecessors, (703), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2024-10-12 19:54:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 821 transitions. [2024-10-12 19:54:15,102 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 821 transitions. Word has length 58 [2024-10-12 19:54:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 821 transitions. [2024-10-12 19:54:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 821 transitions. [2024-10-12 19:54:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:54:15,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:15,108 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:54:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:54:15,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1580994309, now seen corresponding path program 1 times [2024-10-12 19:54:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63080765] [2024-10-12 19:54:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:54:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:54:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63080765] [2024-10-12 19:54:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63080765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453063188] [2024-10-12 19:54:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:15,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:15,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:54:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 19:54:15,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:54:15,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453063188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 19:54:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020156036] [2024-10-12 19:54:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:15,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:15,345 INFO L87 Difference]: Start difference. First operand 616 states and 821 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:15,417 INFO L93 Difference]: Finished difference Result 1104 states and 1495 transitions. [2024-10-12 19:54:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:54:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 19:54:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:15,421 INFO L225 Difference]: With dead ends: 1104 [2024-10-12 19:54:15,421 INFO L226 Difference]: Without dead ends: 621 [2024-10-12 19:54:15,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:15,423 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:15,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:54:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-12 19:54:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2024-10-12 19:54:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 540 states have (on average 1.2962962962962963) internal successors, (700), 549 states have internal predecessors, (700), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2024-10-12 19:54:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 818 transitions. [2024-10-12 19:54:15,457 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 818 transitions. Word has length 59 [2024-10-12 19:54:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:15,458 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 818 transitions. [2024-10-12 19:54:15,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 818 transitions. [2024-10-12 19:54:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:54:15,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:15,460 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:54:15,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:54:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 19:54:15,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash 736988807, now seen corresponding path program 1 times [2024-10-12 19:54:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068086151] [2024-10-12 19:54:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:54:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:54:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068086151] [2024-10-12 19:54:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068086151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501777189] [2024-10-12 19:54:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:15,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:15,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:15,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:54:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:15,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 19:54:15,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:54:15,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501777189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 19:54:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510637297] [2024-10-12 19:54:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:15,843 INFO L87 Difference]: Start difference. First operand 621 states and 818 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:15,901 INFO L93 Difference]: Finished difference Result 1047 states and 1397 transitions. [2024-10-12 19:54:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:54:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 19:54:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:15,906 INFO L225 Difference]: With dead ends: 1047 [2024-10-12 19:54:15,907 INFO L226 Difference]: Without dead ends: 518 [2024-10-12 19:54:15,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:15,909 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:15,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:54:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-12 19:54:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 511. [2024-10-12 19:54:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 448 states have (on average 1.2879464285714286) internal successors, (577), 455 states have internal predecessors, (577), 36 states have call successors, (36), 23 states have call predecessors, (36), 26 states have return successors, (53), 32 states have call predecessors, (53), 34 states have call successors, (53) [2024-10-12 19:54:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 666 transitions. [2024-10-12 19:54:15,941 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 666 transitions. Word has length 59 [2024-10-12 19:54:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:15,942 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 666 transitions. [2024-10-12 19:54:15,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:54:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 666 transitions. [2024-10-12 19:54:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:54:15,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:15,944 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:54:15,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:54:16,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 19:54:16,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:16,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1760338873, now seen corresponding path program 1 times [2024-10-12 19:54:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:16,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105521411] [2024-10-12 19:54:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:54:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:54:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105521411] [2024-10-12 19:54:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105521411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:54:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59726479] [2024-10-12 19:54:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:16,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:54:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:54:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:16,267 INFO L87 Difference]: Start difference. First operand 511 states and 666 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:54:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:16,399 INFO L93 Difference]: Finished difference Result 596 states and 769 transitions. [2024-10-12 19:54:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:54:16,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-10-12 19:54:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:16,402 INFO L225 Difference]: With dead ends: 596 [2024-10-12 19:54:16,402 INFO L226 Difference]: Without dead ends: 593 [2024-10-12 19:54:16,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:16,407 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 201 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:16,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 198 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-12 19:54:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 510. [2024-10-12 19:54:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 448 states have (on average 1.2834821428571428) internal successors, (575), 454 states have internal predecessors, (575), 35 states have call successors, (35), 23 states have call predecessors, (35), 26 states have return successors, (53), 32 states have call predecessors, (53), 34 states have call successors, (53) [2024-10-12 19:54:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 663 transitions. [2024-10-12 19:54:16,441 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 663 transitions. Word has length 59 [2024-10-12 19:54:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 663 transitions. [2024-10-12 19:54:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:54:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 663 transitions. [2024-10-12 19:54:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:54:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:16,444 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:54:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:54:16,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:16,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1263746454, now seen corresponding path program 1 times [2024-10-12 19:54:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388232726] [2024-10-12 19:54:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:54:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:54:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388232726] [2024-10-12 19:54:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388232726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852834161] [2024-10-12 19:54:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:16,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:16,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:16,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:54:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 19:54:16,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:16,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:54:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:54:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852834161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:54:16,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:54:16,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-10-12 19:54:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788506344] [2024-10-12 19:54:16,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:54:16,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:54:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:54:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:16,998 INFO L87 Difference]: Start difference. First operand 510 states and 663 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 19:54:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:17,320 INFO L93 Difference]: Finished difference Result 1313 states and 1698 transitions. [2024-10-12 19:54:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:54:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 60 [2024-10-12 19:54:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:17,327 INFO L225 Difference]: With dead ends: 1313 [2024-10-12 19:54:17,328 INFO L226 Difference]: Without dead ends: 1310 [2024-10-12 19:54:17,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:54:17,330 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 341 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:17,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 569 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-10-12 19:54:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 813. [2024-10-12 19:54:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 715 states have (on average 1.288111888111888) internal successors, (921), 727 states have internal predecessors, (921), 54 states have call successors, (54), 36 states have call predecessors, (54), 43 states have return successors, (83), 49 states have call predecessors, (83), 53 states have call successors, (83) [2024-10-12 19:54:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1058 transitions. [2024-10-12 19:54:17,396 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1058 transitions. Word has length 60 [2024-10-12 19:54:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1058 transitions. [2024-10-12 19:54:17,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 19:54:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1058 transitions. [2024-10-12 19:54:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:54:17,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:17,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 19:54:17,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:54:17,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:17,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash -999777035, now seen corresponding path program 2 times [2024-10-12 19:54:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410749638] [2024-10-12 19:54:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:54:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:54:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:54:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410749638] [2024-10-12 19:54:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410749638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:54:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009551531] [2024-10-12 19:54:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:17,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:54:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:54:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:54:17,663 INFO L87 Difference]: Start difference. First operand 813 states and 1058 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 19:54:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:17,806 INFO L93 Difference]: Finished difference Result 1441 states and 1875 transitions. [2024-10-12 19:54:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:54:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 77 [2024-10-12 19:54:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:17,810 INFO L225 Difference]: With dead ends: 1441 [2024-10-12 19:54:17,810 INFO L226 Difference]: Without dead ends: 782 [2024-10-12 19:54:17,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:17,812 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 107 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:17,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-12 19:54:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 705. [2024-10-12 19:54:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 620 states have (on average 1.2790322580645161) internal successors, (793), 632 states have internal predecessors, (793), 47 states have call successors, (47), 31 states have call predecessors, (47), 37 states have return successors, (72), 41 states have call predecessors, (72), 46 states have call successors, (72) [2024-10-12 19:54:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 912 transitions. [2024-10-12 19:54:17,852 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 912 transitions. Word has length 77 [2024-10-12 19:54:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:17,852 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 912 transitions. [2024-10-12 19:54:17,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 19:54:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 912 transitions. [2024-10-12 19:54:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 19:54:17,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:17,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-12 19:54:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:54:17,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 576351340, now seen corresponding path program 1 times [2024-10-12 19:54:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295663406] [2024-10-12 19:54:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:54:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:54:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:54:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:54:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:54:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:54:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295663406] [2024-10-12 19:54:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295663406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169257003] [2024-10-12 19:54:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:17,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:17,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:17,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:54:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:54:18,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:54:18,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169257003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 19:54:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086420870] [2024-10-12 19:54:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:54:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:54:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:18,033 INFO L87 Difference]: Start difference. First operand 705 states and 912 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:54:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:18,077 INFO L93 Difference]: Finished difference Result 988 states and 1268 transitions. [2024-10-12 19:54:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:54:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 91 [2024-10-12 19:54:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:18,079 INFO L225 Difference]: With dead ends: 988 [2024-10-12 19:54:18,079 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:54:18,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:18,081 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 55 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:18,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 166 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:54:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:54:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:54:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:54:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:54:18,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-10-12 19:54:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:54:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:54:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:54:18,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:54:18,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:54:18,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:54:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:18,291 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:18,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:54:20,602 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:54:20,633 WARN L155 FloydHoareUtils]: Requires clause for immediate_notify_threads contained old-variable. Original clause: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (let ((.cse1 (= 2 |old(~c_dr_st~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse0 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse1) (and (= ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 1) (<= 2 |old(~p_dw_st~0)|) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse0 (= ~p_num_write~0 1))))) Eliminated clause: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse3 (= ~q_free~0 0)) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse1 (= ~p_num_write~0 1)) (and (= ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)))) [2024-10-12 19:54:20,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:54:20 BoogieIcfgContainer [2024-10-12 19:54:20,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:54:20,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:54:20,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:54:20,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:54:20,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:13" (3/4) ... [2024-10-12 19:54:20,690 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:54:20,694 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-10-12 19:54:20,694 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-10-12 19:54:20,695 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-10-12 19:54:20,703 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-12 19:54:20,704 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 19:54:20,704 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 19:54:20,705 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:54:20,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:54:20,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:54:20,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:54:20,825 INFO L158 Benchmark]: Toolchain (without parser) took 8709.62ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 118.6MB in the beginning and 159.4MB in the end (delta: -40.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,826 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:54:20,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.13ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 104.5MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.94ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 102.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,826 INFO L158 Benchmark]: Boogie Preprocessor took 44.95ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,827 INFO L158 Benchmark]: RCFGBuilder took 505.64ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 80.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,827 INFO L158 Benchmark]: TraceAbstraction took 7678.59ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 79.7MB in the beginning and 165.7MB in the end (delta: -85.9MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,827 INFO L158 Benchmark]: Witness Printer took 138.04ms. Allocated memory is still 228.6MB. Free memory was 165.7MB in the beginning and 159.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:54:20,828 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.17ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.13ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 104.5MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.94ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 102.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.95ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.64ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 80.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7678.59ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 79.7MB in the beginning and 165.7MB in the end (delta: -85.9MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. * Witness Printer took 138.04ms. Allocated memory is still 228.6MB. Free memory was 165.7MB in the beginning and 159.4MB 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1164 mSDsluCounter, 2698 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1582 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 796 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 1116 mSDtfsCounter, 796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 880 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 1876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 234/284 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 117]: Location Invariant Derived location invariant: ((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - ProcedureContractResult [Line: 76]: Procedure Contract for immediate_notify_threads Derived contract for procedure immediate_notify_threads. Requires: (((((c_dr_st == 2) && (c_dr_pc == 0)) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) || ((((((p_dw_pc == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_num_write == 1))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) Ensures: (((((((((((p_num_write != 1) || (c_dr_pc != 0)) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (c_num_read != 0)) || (q_free != 0)) && (((((c_dr_pc == 0) && (2 == \old(c_dr_st))) || ((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 == \old(c_dr_st)))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= \old(p_dw_st))) && (c_last_read == p_last_write))) || ((((((p_dw_pc == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_num_write == 1)))) && ((((((((c_dr_pc != 0) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_last_write != q_buf_0)) || (c_num_read != p_num_write)) || (p_dw_st == 0)) || (q_free != 1)) || (c_last_read != p_last_write)) || (\old(p_dw_st) < 2))) && (((((((1 < p_dw_st) || (p_last_write != q_buf_0)) || (c_num_read != p_num_write)) || (p_dw_st == 0)) || (q_free != 1)) || (c_last_read != p_last_write)) || (\old(p_dw_st) < 2))) && (((c_dr_st == 2) || (2 != \old(c_dr_st))) || (c_dr_pc != 0))) - ProcedureContractResult [Line: 220]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) Ensures: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-12 19:54:20,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE