./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.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/combinations/Problem05_label43+token_ring.01.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 b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:56:05,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:56:05,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:56:05,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:56:05,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:56:05,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:56:05,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:56:05,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:56:05,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:56:05,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:56:05,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:56:05,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:56:05,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:56:05,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:56:05,366 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:56:05,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:56:05,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:56:05,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:56:05,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:56:05,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:56:05,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:56:05,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:56:05,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:56:05,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:56:05,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:56:05,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:56:05,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:56:05,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:56:05,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:56:05,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:56:05,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:56:05,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:56:05,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:56:05,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:56:05,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:56:05,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:56:05,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:56:05,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:56:05,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:56:05,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:56:05,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:56:05,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:56:05,375 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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2024-10-12 20:56:05,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:56:05,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:56:05,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:56:05,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:56:05,646 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:56:05,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-12 20:56:07,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:56:07,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:56:07,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-12 20:56:07,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de49120f/d6388cb34ff64b659d4f5b676055a04c/FLAG9fd5413ba [2024-10-12 20:56:08,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de49120f/d6388cb34ff64b659d4f5b676055a04c [2024-10-12 20:56:08,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:56:08,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:56:08,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:56:08,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:56:08,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:56:08,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:56:08" (1/1) ... [2024-10-12 20:56:08,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db56588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:08, skipping insertion in model container [2024-10-12 20:56:08,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:56:08" (1/1) ... [2024-10-12 20:56:08,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:56:09,880 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/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-12 20:56:09,906 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/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-12 20:56:10,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:56:10,041 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:56:10,769 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/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-12 20:56:10,775 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/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-12 20:56:10,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:56:10,894 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:56:10,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10 WrapperNode [2024-10-12 20:56:10,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:56:10,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:56:10,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:56:10,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:56:10,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,464 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-10-12 20:56:11,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:56:11,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:56:11,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:56:11,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:56:11,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,636 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 20:56:11,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:56:11,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:56:11,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:56:11,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:56:11,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (1/1) ... [2024-10-12 20:56:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:56:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:12,024 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 20:56:12,027 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 20:56:12,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:56:12,079 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:56:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:56:12,079 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:56:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:56:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:56:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:56:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:56:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:56:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:56:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:56:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:56:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:56:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:56:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:56:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:56:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:56:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:56:12,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:56:12,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:56:19,805 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-10-12 20:56:19,806 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:56:19,942 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:56:19,942 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 20:56:19,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:56:19 BoogieIcfgContainer [2024-10-12 20:56:19,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:56:19,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:56:19,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:56:19,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:56:19,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:56:08" (1/3) ... [2024-10-12 20:56:19,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a38dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:56:19, skipping insertion in model container [2024-10-12 20:56:19,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:10" (2/3) ... [2024-10-12 20:56:19,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a38dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:56:19, skipping insertion in model container [2024-10-12 20:56:19,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:56:19" (3/3) ... [2024-10-12 20:56:19,951 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2024-10-12 20:56:19,969 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:56:19,969 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:56:20,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:56:20,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;@1ef8c0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:56:20,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:56:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 20:56:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:56:20,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:20,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:20,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:20,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -365934265, now seen corresponding path program 1 times [2024-10-12 20:56:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:20,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296477204] [2024-10-12 20:56:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:20,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:20,622 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 20:56:20,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296477204] [2024-10-12 20:56:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296477204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:56:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974118251] [2024-10-12 20:56:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:20,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:56:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:56:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:20,673 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:21,524 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2024-10-12 20:56:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:56:21,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 20:56:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:21,565 INFO L225 Difference]: With dead ends: 4576 [2024-10-12 20:56:21,566 INFO L226 Difference]: Without dead ends: 2351 [2024-10-12 20:56:21,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:21,583 INFO L432 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:56:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-10-12 20:56:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2024-10-12 20:56:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-12 20:56:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2024-10-12 20:56:21,753 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2024-10-12 20:56:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:21,754 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2024-10-12 20:56:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2024-10-12 20:56:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:56:21,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:21,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:21,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:56:21,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 101066947, now seen corresponding path program 1 times [2024-10-12 20:56:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670866837] [2024-10-12 20:56:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:21,989 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 20:56:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670866837] [2024-10-12 20:56:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670866837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63762239] [2024-10-12 20:56:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:21,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:21,994 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:22,856 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2024-10-12 20:56:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:22,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 20:56:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:22,870 INFO L225 Difference]: With dead ends: 2639 [2024-10-12 20:56:22,871 INFO L226 Difference]: Without dead ends: 2457 [2024-10-12 20:56:22,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:22,874 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:22,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:56:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-10-12 20:56:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2024-10-12 20:56:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-12 20:56:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2024-10-12 20:56:22,962 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2024-10-12 20:56:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2024-10-12 20:56:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2024-10-12 20:56:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:56:22,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:22,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:22,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:56:22,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:22,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash 524713669, now seen corresponding path program 1 times [2024-10-12 20:56:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614580148] [2024-10-12 20:56:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,129 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 20:56:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614580148] [2024-10-12 20:56:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614580148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398426553] [2024-10-12 20:56:23,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:23,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:23,134 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:23,993 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2024-10-12 20:56:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:56:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 20:56:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:24,007 INFO L225 Difference]: With dead ends: 2964 [2024-10-12 20:56:24,007 INFO L226 Difference]: Without dead ends: 2698 [2024-10-12 20:56:24,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:56:24,010 INFO L432 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:24,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:56:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2024-10-12 20:56:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2024-10-12 20:56:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-12 20:56:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2024-10-12 20:56:24,094 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2024-10-12 20:56:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:24,094 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2024-10-12 20:56:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2024-10-12 20:56:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:56:24,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:24,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:24,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:56:24,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:24,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash -847093629, now seen corresponding path program 1 times [2024-10-12 20:56:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141903956] [2024-10-12 20:56:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:24,203 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 20:56:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141903956] [2024-10-12 20:56:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141903956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:24,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825625202] [2024-10-12 20:56:24,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:24,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:24,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:24,206 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:24,999 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2024-10-12 20:56:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:56:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 20:56:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:25,017 INFO L225 Difference]: With dead ends: 3480 [2024-10-12 20:56:25,017 INFO L226 Difference]: Without dead ends: 3049 [2024-10-12 20:56:25,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:56:25,025 INFO L432 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:25,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:56:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2024-10-12 20:56:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2024-10-12 20:56:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-12 20:56:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2024-10-12 20:56:25,146 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2024-10-12 20:56:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:25,148 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2024-10-12 20:56:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2024-10-12 20:56:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:56:25,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:25,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:25,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:56:25,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:25,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1602506501, now seen corresponding path program 1 times [2024-10-12 20:56:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041514587] [2024-10-12 20:56:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:25,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,260 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 20:56:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041514587] [2024-10-12 20:56:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041514587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:56:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112763384] [2024-10-12 20:56:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:25,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:56:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:25,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:56:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:25,264 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:25,961 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2024-10-12 20:56:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:56:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-12 20:56:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:25,977 INFO L225 Difference]: With dead ends: 4114 [2024-10-12 20:56:25,977 INFO L226 Difference]: Without dead ends: 3403 [2024-10-12 20:56:25,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:56:25,982 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:25,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:56:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-10-12 20:56:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2024-10-12 20:56:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-12 20:56:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2024-10-12 20:56:26,124 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2024-10-12 20:56:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:26,124 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2024-10-12 20:56:26,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2024-10-12 20:56:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:56:26,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:26,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:56:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:56:26,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:26,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash -179544944, now seen corresponding path program 1 times [2024-10-12 20:56:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951840724] [2024-10-12 20:56:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:56:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 20:56:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:56:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951840724] [2024-10-12 20:56:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951840724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765848885] [2024-10-12 20:56:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:26,272 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 20:56:26,274 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 20:56:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:26,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:56:26,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:56:26,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765848885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:56:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888477430] [2024-10-12 20:56:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:26,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:26,403 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:26,634 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2024-10-12 20:56:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:26,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-12 20:56:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:26,654 INFO L225 Difference]: With dead ends: 5267 [2024-10-12 20:56:26,654 INFO L226 Difference]: Without dead ends: 4185 [2024-10-12 20:56:26,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:26,659 INFO L432 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:26,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2024-10-12 20:56:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2024-10-12 20:56:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2024-10-12 20:56:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2024-10-12 20:56:26,827 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2024-10-12 20:56:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:26,827 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2024-10-12 20:56:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2024-10-12 20:56:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:56:26,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:26,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:26,852 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 20:56:27,033 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 20:56:27,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash 20714924, now seen corresponding path program 1 times [2024-10-12 20:56:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187342253] [2024-10-12 20:56:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:56:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 20:56:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:56:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 20:56:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187342253] [2024-10-12 20:56:27,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187342253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419994190] [2024-10-12 20:56:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:27,141 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 20:56:27,143 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 20:56:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:56:27,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:56:27,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419994190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:56:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590495849] [2024-10-12 20:56:27,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:27,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:27,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:27,347 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:56:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:27,582 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2024-10-12 20:56:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-10-12 20:56:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:27,615 INFO L225 Difference]: With dead ends: 8169 [2024-10-12 20:56:27,615 INFO L226 Difference]: Without dead ends: 6117 [2024-10-12 20:56:27,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:27,629 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:27,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2024-10-12 20:56:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2024-10-12 20:56:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2024-10-12 20:56:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2024-10-12 20:56:27,907 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2024-10-12 20:56:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:27,908 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2024-10-12 20:56:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:56:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2024-10-12 20:56:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 20:56:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:27,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:27,939 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 20:56:28,123 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 20:56:28,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1514455832, now seen corresponding path program 1 times [2024-10-12 20:56:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460803155] [2024-10-12 20:56:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:56:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:56:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:56:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:56:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 20:56:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460803155] [2024-10-12 20:56:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460803155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995920093] [2024-10-12 20:56:28,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:28,257 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 20:56:28,258 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 20:56:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:28,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:56:28,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 20:56:28,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995920093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:56:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039031449] [2024-10-12 20:56:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:28,477 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 20:56:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:28,698 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2024-10-12 20:56:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2024-10-12 20:56:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:28,734 INFO L225 Difference]: With dead ends: 9149 [2024-10-12 20:56:28,734 INFO L226 Difference]: Without dead ends: 6373 [2024-10-12 20:56:28,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:28,746 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:28,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2024-10-12 20:56:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2024-10-12 20:56:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2024-10-12 20:56:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2024-10-12 20:56:29,029 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2024-10-12 20:56:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:29,030 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2024-10-12 20:56:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 20:56:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2024-10-12 20:56:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 20:56:29,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:29,039 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:29,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:56:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:29,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -444169551, now seen corresponding path program 1 times [2024-10-12 20:56:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726954953] [2024-10-12 20:56:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:56:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:56:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:56:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:56:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 20:56:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726954953] [2024-10-12 20:56:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726954953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894181985] [2024-10-12 20:56:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:29,356 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 20:56:29,357 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 20:56:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:56:29,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 20:56:29,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894181985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:29,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:56:29,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87233199] [2024-10-12 20:56:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:29,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:29,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:29,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:29,483 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:56:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:30,082 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2024-10-12 20:56:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-12 20:56:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:30,130 INFO L225 Difference]: With dead ends: 14423 [2024-10-12 20:56:30,130 INFO L226 Difference]: Without dead ends: 10223 [2024-10-12 20:56:30,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:30,148 INFO L432 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:30,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2024-10-12 20:56:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2024-10-12 20:56:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-12 20:56:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2024-10-12 20:56:30,934 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2024-10-12 20:56:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:30,935 INFO L471 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2024-10-12 20:56:30,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:56:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2024-10-12 20:56:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:56:30,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:30,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:30,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:56:31,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:31,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:31,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490321, now seen corresponding path program 1 times [2024-10-12 20:56:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988989806] [2024-10-12 20:56:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:56:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 20:56:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988989806] [2024-10-12 20:56:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988989806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212221260] [2024-10-12 20:56:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:31,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:31,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:31,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:56:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:31,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:56:31,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 20:56:31,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212221260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:56:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050166324] [2024-10-12 20:56:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:31,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:31,424 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:56:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:31,993 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2024-10-12 20:56:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2024-10-12 20:56:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:32,041 INFO L225 Difference]: With dead ends: 14381 [2024-10-12 20:56:32,041 INFO L226 Difference]: Without dead ends: 10227 [2024-10-12 20:56:32,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:32,061 INFO L432 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:32,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2024-10-12 20:56:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2024-10-12 20:56:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-12 20:56:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2024-10-12 20:56:32,536 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2024-10-12 20:56:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:32,537 INFO L471 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2024-10-12 20:56:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:56:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2024-10-12 20:56:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:56:32,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:32,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 20:56:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 20:56:32,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1898602929, now seen corresponding path program 1 times [2024-10-12 20:56:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560700449] [2024-10-12 20:56:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:56:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 20:56:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560700449] [2024-10-12 20:56:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560700449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54690397] [2024-10-12 20:56:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:32,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:32,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:56:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:56:33,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 20:56:33,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54690397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:56:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409333000] [2024-10-12 20:56:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:33,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:56:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:56:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:33,113 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:56:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:33,559 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2024-10-12 20:56:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:56:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2024-10-12 20:56:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:33,596 INFO L225 Difference]: With dead ends: 16127 [2024-10-12 20:56:33,596 INFO L226 Difference]: Without dead ends: 9051 [2024-10-12 20:56:33,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:33,615 INFO L432 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:33,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2024-10-12 20:56:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2024-10-12 20:56:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2024-10-12 20:56:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2024-10-12 20:56:34,036 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2024-10-12 20:56:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:34,036 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2024-10-12 20:56:34,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:56:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2024-10-12 20:56:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:56:34,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:34,049 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:34,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 20:56:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:34,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -315841116, now seen corresponding path program 1 times [2024-10-12 20:56:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335334507] [2024-10-12 20:56:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 20:56:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335334507] [2024-10-12 20:56:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335334507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307323008] [2024-10-12 20:56:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:34,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:34,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:34,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 20:56:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:34,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:56:34,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 20:56:34,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307323008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-12 20:56:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238416199] [2024-10-12 20:56:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:34,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:56:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:56:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:56:34,572 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:34,956 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2024-10-12 20:56:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:56:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-12 20:56:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:34,987 INFO L225 Difference]: With dead ends: 11183 [2024-10-12 20:56:34,988 INFO L226 Difference]: Without dead ends: 6959 [2024-10-12 20:56:35,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:56:35,002 INFO L432 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:35,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:56:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2024-10-12 20:56:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2024-10-12 20:56:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-10-12 20:56:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2024-10-12 20:56:35,478 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2024-10-12 20:56:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:35,479 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2024-10-12 20:56:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2024-10-12 20:56:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:56:35,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:35,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:35,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 20:56:35,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:35,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1934816030, now seen corresponding path program 1 times [2024-10-12 20:56:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813484980] [2024-10-12 20:56:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 20:56:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813484980] [2024-10-12 20:56:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813484980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949191037] [2024-10-12 20:56:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:35,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 20:56:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:56:35,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 20:56:35,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949191037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:35,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-12 20:56:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64553883] [2024-10-12 20:56:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:36,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:56:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:56:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:56:36,001 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:36,459 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2024-10-12 20:56:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:56:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-12 20:56:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:36,485 INFO L225 Difference]: With dead ends: 10847 [2024-10-12 20:56:36,486 INFO L226 Difference]: Without dead ends: 6579 [2024-10-12 20:56:36,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:36,500 INFO L432 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:36,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:56:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-12 20:56:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2024-10-12 20:56:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-10-12 20:56:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2024-10-12 20:56:36,749 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2024-10-12 20:56:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:36,750 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2024-10-12 20:56:36,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2024-10-12 20:56:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:56:36,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:36,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:36,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 20:56:36,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 20:56:36,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1476642276, now seen corresponding path program 1 times [2024-10-12 20:56:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445107619] [2024-10-12 20:56:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 20:56:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445107619] [2024-10-12 20:56:37,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445107619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205531729] [2024-10-12 20:56:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:37,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 20:56:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 20:56:37,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 20:56:37,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205531729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:37,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-12 20:56:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584949991] [2024-10-12 20:56:37,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:37,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:56:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:56:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:37,171 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:37,371 INFO L93 Difference]: Finished difference Result 6815 states and 9762 transitions. [2024-10-12 20:56:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:56:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-12 20:56:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:37,387 INFO L225 Difference]: With dead ends: 6815 [2024-10-12 20:56:37,387 INFO L226 Difference]: Without dead ends: 3962 [2024-10-12 20:56:37,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:37,396 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 0 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:37,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12247 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-10-12 20:56:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2024-10-12 20:56:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3595 states have (on average 1.5794158553546593) internal successors, (5678), 3613 states have internal predecessors, (5678), 209 states have call successors, (209), 147 states have call predecessors, (209), 156 states have return successors, (250), 203 states have call predecessors, (250), 207 states have call successors, (250) [2024-10-12 20:56:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6137 transitions. [2024-10-12 20:56:37,559 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6137 transitions. Word has length 125 [2024-10-12 20:56:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:37,560 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 6137 transitions. [2024-10-12 20:56:37,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6137 transitions. [2024-10-12 20:56:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:56:37,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:37,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:37,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 20:56:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 20:56:37,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:37,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -985130332, now seen corresponding path program 1 times [2024-10-12 20:56:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:37,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872739941] [2024-10-12 20:56:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:37,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 20:56:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872739941] [2024-10-12 20:56:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872739941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:56:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344675726] [2024-10-12 20:56:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:56:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:37,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:56:37,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 20:56:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 20:56:38,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:56:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 20:56:38,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:56:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344675726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:38,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:56:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-12 20:56:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318337388] [2024-10-12 20:56:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:56:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:56:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:38,098 INFO L87 Difference]: Start difference. First operand 3962 states and 6137 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:38,346 INFO L93 Difference]: Finished difference Result 5053 states and 7447 transitions. [2024-10-12 20:56:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:56:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-12 20:56:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:38,359 INFO L225 Difference]: With dead ends: 5053 [2024-10-12 20:56:38,359 INFO L226 Difference]: Without dead ends: 2852 [2024-10-12 20:56:38,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:38,367 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:38,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:56:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-10-12 20:56:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2024-10-12 20:56:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-12 20:56:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2024-10-12 20:56:38,500 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2024-10-12 20:56:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2024-10-12 20:56:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2024-10-12 20:56:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 20:56:38,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:38,504 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:38,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 20:56:38,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 20:56:38,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:38,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -88102940, now seen corresponding path program 1 times [2024-10-12 20:56:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084733444] [2024-10-12 20:56:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 20:56:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084733444] [2024-10-12 20:56:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084733444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:56:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136362264] [2024-10-12 20:56:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:38,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:56:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:56:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:38,896 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 20:56:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:39,496 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2024-10-12 20:56:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:56:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2024-10-12 20:56:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:39,509 INFO L225 Difference]: With dead ends: 2874 [2024-10-12 20:56:39,509 INFO L226 Difference]: Without dead ends: 2871 [2024-10-12 20:56:39,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:56:39,512 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:56:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-10-12 20:56:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2024-10-12 20:56:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-12 20:56:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2024-10-12 20:56:39,654 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2024-10-12 20:56:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:39,655 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2024-10-12 20:56:39,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 20:56:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2024-10-12 20:56:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:56:39,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:39,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:39,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:56:39,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:39,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:39,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1275818764, now seen corresponding path program 1 times [2024-10-12 20:56:39,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:39,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653580932] [2024-10-12 20:56:39,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:39,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:56:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:56:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 20:56:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:56:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:56:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:56:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:56:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:56:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:56:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-12 20:56:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653580932] [2024-10-12 20:56:39,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653580932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:39,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:39,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:56:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928587997] [2024-10-12 20:56:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:39,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:56:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:39,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:56:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:56:39,757 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:40,145 INFO L93 Difference]: Finished difference Result 3238 states and 5230 transitions. [2024-10-12 20:56:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:56:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2024-10-12 20:56:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:40,218 INFO L225 Difference]: With dead ends: 3238 [2024-10-12 20:56:40,219 INFO L226 Difference]: Without dead ends: 2873 [2024-10-12 20:56:40,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:40,222 INFO L432 NwaCegarLoop]: 4041 mSDtfsCounter, 90 mSDsluCounter, 12024 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16065 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:40,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 16065 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:56:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-12 20:56:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2853. [2024-10-12 20:56:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-12 20:56:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2024-10-12 20:56:40,361 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2024-10-12 20:56:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2024-10-12 20:56:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:56:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2024-10-12 20:56:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 20:56:40,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:40,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:40,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:56:40,365 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:40,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2124916191, now seen corresponding path program 1 times [2024-10-12 20:56:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:40,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380023445] [2024-10-12 20:56:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:56:40,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 20:56:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:56:40,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 20:56:40,452 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 20:56:40,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-12 20:56:40,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-12 20:56:40,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:56:40,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:56:40,577 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 20:56:40,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:56:40 BoogieIcfgContainer [2024-10-12 20:56:40,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 20:56:40,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 20:56:40,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 20:56:40,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 20:56:40,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:56:19" (3/4) ... [2024-10-12 20:56:40,582 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 20:56:40,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 20:56:40,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 20:56:40,712 INFO L158 Benchmark]: Toolchain (without parser) took 32604.96ms. Allocated memory was 169.9MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 111.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 838.7MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,713 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 20:56:40,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2787.04ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 111.4MB in the beginning and 133.1MB in the end (delta: -21.7MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 569.39ms. Allocated memory was 232.8MB in the beginning and 383.8MB in the end (delta: 151.0MB). Free memory was 133.1MB in the beginning and 241.2MB in the end (delta: -108.1MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,714 INFO L158 Benchmark]: Boogie Preprocessor took 524.23ms. Allocated memory is still 383.8MB. Free memory was 241.2MB in the beginning and 196.1MB in the end (delta: 45.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,714 INFO L158 Benchmark]: RCFGBuilder took 7951.49ms. Allocated memory was 383.8MB in the beginning and 1.2GB in the end (delta: 822.1MB). Free memory was 195.0MB in the beginning and 882.9MB in the end (delta: -687.9MB). Peak memory consumption was 397.4MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,714 INFO L158 Benchmark]: TraceAbstraction took 20635.62ms. Allocated memory was 1.2GB in the beginning and 3.0GB in the end (delta: 1.8GB). Free memory was 882.9MB in the beginning and 2.1GB in the end (delta: -1.2GB). Peak memory consumption was 554.7MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,715 INFO L158 Benchmark]: Witness Printer took 130.91ms. Allocated memory is still 3.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 20:56:40,716 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.18ms. Allocated memory is still 96.5MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2787.04ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 111.4MB in the beginning and 133.1MB in the end (delta: -21.7MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 569.39ms. Allocated memory was 232.8MB in the beginning and 383.8MB in the end (delta: 151.0MB). Free memory was 133.1MB in the beginning and 241.2MB in the end (delta: -108.1MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 524.23ms. Allocated memory is still 383.8MB. Free memory was 241.2MB in the beginning and 196.1MB in the end (delta: 45.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7951.49ms. Allocated memory was 383.8MB in the beginning and 1.2GB in the end (delta: 822.1MB). Free memory was 195.0MB in the beginning and 882.9MB in the end (delta: -687.9MB). Peak memory consumption was 397.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20635.62ms. Allocated memory was 1.2GB in the beginning and 3.0GB in the end (delta: 1.8GB). Free memory was 882.9MB in the beginning and 2.1GB in the end (delta: -1.2GB). Peak memory consumption was 554.7MB. Max. memory is 16.1GB. * Witness Printer took 130.91ms. Allocated memory is still 3.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11118]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46577 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46481 mSDsluCounter, 211874 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142147 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4485 IncrementalHoareTripleChecker+Invalid, 4912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 69727 mSDtfsCounter, 4485 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2839 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 20:56:40,751 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE