./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 16:16:10,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 16:16:10,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 16:16:10,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 16:16:10,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 16:16:10,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 16:16:10,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 16:16:10,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 16:16:10,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 16:16:10,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 16:16:10,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 16:16:10,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 16:16:10,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 16:16:10,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 16:16:10,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 16:16:10,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 16:16:10,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 16:16:10,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 16:16:10,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 16:16:10,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 16:16:10,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 16:16:10,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 16:16:10,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 16:16:10,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 16:16:10,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 16:16:10,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 16:16:10,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 16:16:10,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 16:16:10,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 16:16:10,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 16:16:10,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 16:16:10,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 16:16:10,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:16:10,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 16:16:10,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 16:16:10,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 16:16:10,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 16:16:10,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 16:16:10,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 16:16:10,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 16:16:10,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 16:16:10,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 16:16:10,544 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2024-11-18 16:16:10,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 16:16:10,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 16:16:10,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 16:16:10,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 16:16:10,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 16:16:10,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2024-11-18 16:16:12,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 16:16:12,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 16:16:12,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2024-11-18 16:16:12,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8bcba57/e211034180d74e9dab2a547f47630e4a/FLAG5f0cfb6dc [2024-11-18 16:16:13,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8bcba57/e211034180d74e9dab2a547f47630e4a [2024-11-18 16:16:13,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 16:16:13,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 16:16:13,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 16:16:13,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 16:16:13,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 16:16:13,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f3ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13, skipping insertion in model container [2024-11-18 16:16:13,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 16:16:13,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2024-11-18 16:16:13,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2024-11-18 16:16:13,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:16:13,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 16:16:13,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2024-11-18 16:16:13,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2024-11-18 16:16:13,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:16:13,719 INFO L204 MainTranslator]: Completed translation [2024-11-18 16:16:13,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13 WrapperNode [2024-11-18 16:16:13,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 16:16:13,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 16:16:13,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 16:16:13,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 16:16:13,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,800 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 429 [2024-11-18 16:16:13,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 16:16:13,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 16:16:13,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 16:16:13,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 16:16:13,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 16:16:13,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 16:16:13,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 16:16:13,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 16:16:13,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 16:16:13,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (1/1) ... [2024-11-18 16:16:13,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:16:13,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:13,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 16:16:13,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 16:16:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 16:16:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 16:16:13,961 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 16:16:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-18 16:16:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-18 16:16:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-18 16:16:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-18 16:16:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-18 16:16:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-18 16:16:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-18 16:16:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-18 16:16:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-18 16:16:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-18 16:16:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-18 16:16:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-18 16:16:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 16:16:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-18 16:16:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-18 16:16:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 16:16:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 16:16:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-18 16:16:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-18 16:16:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-18 16:16:13,965 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-18 16:16:14,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 16:16:14,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 16:16:14,423 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-18 16:16:14,423 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 16:16:14,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 16:16:14,444 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-18 16:16:14,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:14 BoogieIcfgContainer [2024-11-18 16:16:14,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 16:16:14,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 16:16:14,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 16:16:14,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 16:16:14,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:16:13" (1/3) ... [2024-11-18 16:16:14,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bfd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:16:14, skipping insertion in model container [2024-11-18 16:16:14,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:13" (2/3) ... [2024-11-18 16:16:14,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3bfd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:16:14, skipping insertion in model container [2024-11-18 16:16:14,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:14" (3/3) ... [2024-11-18 16:16:14,452 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2024-11-18 16:16:14,464 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 16:16:14,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 16:16:14,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 16:16:14,531 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;@6d041080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 16:16:14,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 16:16:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 153 states have (on average 1.5490196078431373) internal successors, (237), 160 states have internal predecessors, (237), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-18 16:16:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 16:16:14,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:14,551 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] [2024-11-18 16:16:14,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1040266463, now seen corresponding path program 1 times [2024-11-18 16:16:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31424671] [2024-11-18 16:16:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:14,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31424671] [2024-11-18 16:16:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31424671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:14,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:14,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924841914] [2024-11-18 16:16:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:14,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:14,934 INFO L87 Difference]: Start difference. First operand has 189 states, 153 states have (on average 1.5490196078431373) internal successors, (237), 160 states have internal predecessors, (237), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,047 INFO L93 Difference]: Finished difference Result 422 states and 640 transitions. [2024-11-18 16:16:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:15,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-18 16:16:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,064 INFO L225 Difference]: With dead ends: 422 [2024-11-18 16:16:15,064 INFO L226 Difference]: Without dead ends: 237 [2024-11-18 16:16:15,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,071 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 239 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 358 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-18 16:16:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-11-18 16:16:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4175257731958764) internal successors, (275), 198 states have internal predecessors, (275), 27 states have call successors, (27), 12 states have call predecessors, (27), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2024-11-18 16:16:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-11-18 16:16:15,263 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 44 [2024-11-18 16:16:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-11-18 16:16:15,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-11-18 16:16:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 16:16:15,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,267 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] [2024-11-18 16:16:15,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 16:16:15,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1446836249, now seen corresponding path program 1 times [2024-11-18 16:16:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913698445] [2024-11-18 16:16:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913698445] [2024-11-18 16:16:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913698445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10175310] [2024-11-18 16:16:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,478 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,570 INFO L93 Difference]: Finished difference Result 441 states and 617 transitions. [2024-11-18 16:16:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:15,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-18 16:16:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,583 INFO L225 Difference]: With dead ends: 441 [2024-11-18 16:16:15,583 INFO L226 Difference]: Without dead ends: 326 [2024-11-18 16:16:15,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,585 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 67 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 503 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-18 16:16:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2024-11-18 16:16:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 255 states have (on average 1.407843137254902) internal successors, (359), 259 states have internal predecessors, (359), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-18 16:16:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 420 transitions. [2024-11-18 16:16:15,632 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 420 transitions. Word has length 45 [2024-11-18 16:16:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,632 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 420 transitions. [2024-11-18 16:16:15,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 420 transitions. [2024-11-18 16:16:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 16:16:15,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,634 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] [2024-11-18 16:16:15,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 16:16:15,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,635 INFO L85 PathProgramCache]: Analyzing trace with hash 162478788, now seen corresponding path program 1 times [2024-11-18 16:16:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427026356] [2024-11-18 16:16:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427026356] [2024-11-18 16:16:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427026356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235046375] [2024-11-18 16:16:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,686 INFO L87 Difference]: Start difference. First operand 300 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,718 INFO L93 Difference]: Finished difference Result 653 states and 908 transitions. [2024-11-18 16:16:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-18 16:16:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,722 INFO L225 Difference]: With dead ends: 653 [2024-11-18 16:16:15,722 INFO L226 Difference]: Without dead ends: 471 [2024-11-18 16:16:15,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,724 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 226 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-18 16:16:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 457. [2024-11-18 16:16:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 394 states have (on average 1.3730964467005076) internal successors, (541), 400 states have internal predecessors, (541), 41 states have call successors, (41), 22 states have call predecessors, (41), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-18 16:16:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 629 transitions. [2024-11-18 16:16:15,782 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 629 transitions. Word has length 45 [2024-11-18 16:16:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,782 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 629 transitions. [2024-11-18 16:16:15,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 629 transitions. [2024-11-18 16:16:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 16:16:15,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:15,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 16:16:15,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2084248473, now seen corresponding path program 1 times [2024-11-18 16:16:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152340750] [2024-11-18 16:16:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152340750] [2024-11-18 16:16:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152340750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048296360] [2024-11-18 16:16:15,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:15,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,857 INFO L87 Difference]: Start difference. First operand 457 states and 629 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,899 INFO L93 Difference]: Finished difference Result 562 states and 779 transitions. [2024-11-18 16:16:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 16:16:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,902 INFO L225 Difference]: With dead ends: 562 [2024-11-18 16:16:15,903 INFO L226 Difference]: Without dead ends: 457 [2024-11-18 16:16:15,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:15,905 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 152 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 342 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-18 16:16:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2024-11-18 16:16:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 394 states have (on average 1.3705583756345177) internal successors, (540), 400 states have internal predecessors, (540), 41 states have call successors, (41), 22 states have call predecessors, (41), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-18 16:16:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 628 transitions. [2024-11-18 16:16:15,984 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 628 transitions. Word has length 58 [2024-11-18 16:16:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 628 transitions. [2024-11-18 16:16:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 628 transitions. [2024-11-18 16:16:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 16:16:15,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:15,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 16:16:15,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1603168215, now seen corresponding path program 1 times [2024-11-18 16:16:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756138020] [2024-11-18 16:16:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756138020] [2024-11-18 16:16:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756138020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:16:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167593824] [2024-11-18 16:16:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:16,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:16,092 INFO L87 Difference]: Start difference. First operand 457 states and 628 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:16,457 INFO L93 Difference]: Finished difference Result 665 states and 928 transitions. [2024-11-18 16:16:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:16:16,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 16:16:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:16,460 INFO L225 Difference]: With dead ends: 665 [2024-11-18 16:16:16,464 INFO L226 Difference]: Without dead ends: 563 [2024-11-18 16:16:16,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-18 16:16:16,470 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 349 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:16,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 579 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-18 16:16:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2024-11-18 16:16:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 474 states have (on average 1.3860759493670887) internal successors, (657), 481 states have internal predecessors, (657), 51 states have call successors, (51), 28 states have call predecessors, (51), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2024-11-18 16:16:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 766 transitions. [2024-11-18 16:16:16,535 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 766 transitions. Word has length 58 [2024-11-18 16:16:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:16,536 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 766 transitions. [2024-11-18 16:16:16,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 766 transitions. [2024-11-18 16:16:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 16:16:16,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:16,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:16,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 16:16:16,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:16,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 191090981, now seen corresponding path program 1 times [2024-11-18 16:16:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79904569] [2024-11-18 16:16:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79904569] [2024-11-18 16:16:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79904569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152282099] [2024-11-18 16:16:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:16,825 INFO L87 Difference]: Start difference. First operand 554 states and 766 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:17,632 INFO L93 Difference]: Finished difference Result 870 states and 1217 transitions. [2024-11-18 16:16:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:17,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 16:16:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:17,637 INFO L225 Difference]: With dead ends: 870 [2024-11-18 16:16:17,637 INFO L226 Difference]: Without dead ends: 671 [2024-11-18 16:16:17,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:17,639 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 336 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:17,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 976 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 16:16:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-18 16:16:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 646. [2024-11-18 16:16:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 549 states have (on average 1.3916211293260474) internal successors, (764), 557 states have internal predecessors, (764), 61 states have call successors, (61), 34 states have call predecessors, (61), 34 states have return successors, (71), 56 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-18 16:16:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 896 transitions. [2024-11-18 16:16:17,676 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 896 transitions. Word has length 58 [2024-11-18 16:16:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 896 transitions. [2024-11-18 16:16:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 896 transitions. [2024-11-18 16:16:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 16:16:17,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:17,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:17,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 16:16:17,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:17,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1084577319, now seen corresponding path program 1 times [2024-11-18 16:16:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822334809] [2024-11-18 16:16:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:17,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:17,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822334809] [2024-11-18 16:16:17,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822334809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:17,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195456997] [2024-11-18 16:16:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:17,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:17,750 INFO L87 Difference]: Start difference. First operand 646 states and 896 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,144 INFO L93 Difference]: Finished difference Result 1150 states and 1609 transitions. [2024-11-18 16:16:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 16:16:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,151 INFO L225 Difference]: With dead ends: 1150 [2024-11-18 16:16:18,151 INFO L226 Difference]: Without dead ends: 859 [2024-11-18 16:16:18,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:18,153 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 330 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 929 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-18 16:16:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 806. [2024-11-18 16:16:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 675 states have (on average 1.385185185185185) internal successors, (935), 687 states have internal predecessors, (935), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (101), 76 states have call predecessors, (101), 75 states have call successors, (101) [2024-11-18 16:16:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1115 transitions. [2024-11-18 16:16:18,208 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1115 transitions. Word has length 58 [2024-11-18 16:16:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:18,208 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1115 transitions. [2024-11-18 16:16:18,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1115 transitions. [2024-11-18 16:16:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 16:16:18,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:18,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 16:16:18,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 187184041, now seen corresponding path program 1 times [2024-11-18 16:16:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503580653] [2024-11-18 16:16:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503580653] [2024-11-18 16:16:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503580653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:16:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388199658] [2024-11-18 16:16:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:18,328 INFO L87 Difference]: Start difference. First operand 806 states and 1115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,476 INFO L93 Difference]: Finished difference Result 1521 states and 2128 transitions. [2024-11-18 16:16:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:18,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 16:16:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,480 INFO L225 Difference]: With dead ends: 1521 [2024-11-18 16:16:18,481 INFO L226 Difference]: Without dead ends: 1071 [2024-11-18 16:16:18,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:18,484 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 346 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 655 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-18 16:16:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1062. [2024-11-18 16:16:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 880 states have (on average 1.3772727272727272) internal successors, (1212), 897 states have internal predecessors, (1212), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2024-11-18 16:16:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1457 transitions. [2024-11-18 16:16:18,554 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1457 transitions. Word has length 58 [2024-11-18 16:16:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1457 transitions. [2024-11-18 16:16:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1457 transitions. [2024-11-18 16:16:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-18 16:16:18,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:18,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:18,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 16:16:18,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:18,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1274087825, now seen corresponding path program 1 times [2024-11-18 16:16:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738113677] [2024-11-18 16:16:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 16:16:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738113677] [2024-11-18 16:16:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738113677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:18,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459758790] [2024-11-18 16:16:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:18,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:18,603 INFO L87 Difference]: Start difference. First operand 1062 states and 1457 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,673 INFO L93 Difference]: Finished difference Result 1574 states and 2154 transitions. [2024-11-18 16:16:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-18 16:16:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,678 INFO L225 Difference]: With dead ends: 1574 [2024-11-18 16:16:18,678 INFO L226 Difference]: Without dead ends: 1235 [2024-11-18 16:16:18,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:18,681 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 55 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 546 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-11-18 16:16:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1235. [2024-11-18 16:16:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1031 states have (on average 1.3511154219204655) internal successors, (1393), 1048 states have internal predecessors, (1393), 124 states have call successors, (124), 72 states have call predecessors, (124), 78 states have return successors, (157), 118 states have call predecessors, (157), 120 states have call successors, (157) [2024-11-18 16:16:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1674 transitions. [2024-11-18 16:16:18,799 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1674 transitions. Word has length 62 [2024-11-18 16:16:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1674 transitions. [2024-11-18 16:16:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1674 transitions. [2024-11-18 16:16:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 16:16:18,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:18,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:18,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 16:16:18,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:18,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1445310510, now seen corresponding path program 1 times [2024-11-18 16:16:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005516914] [2024-11-18 16:16:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 16:16:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005516914] [2024-11-18 16:16:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005516914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649185976] [2024-11-18 16:16:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:18,858 INFO L87 Difference]: Start difference. First operand 1235 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 16:16:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,944 INFO L93 Difference]: Finished difference Result 1782 states and 2395 transitions. [2024-11-18 16:16:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-18 16:16:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,951 INFO L225 Difference]: With dead ends: 1782 [2024-11-18 16:16:18,951 INFO L226 Difference]: Without dead ends: 1362 [2024-11-18 16:16:18,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:18,953 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 212 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-18 16:16:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2024-11-18 16:16:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1144 states have (on average 1.3330419580419581) internal successors, (1525), 1161 states have internal predecessors, (1525), 132 states have call successors, (132), 78 states have call predecessors, (132), 84 states have return successors, (169), 126 states have call predecessors, (169), 128 states have call successors, (169) [2024-11-18 16:16:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1826 transitions. [2024-11-18 16:16:19,092 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1826 transitions. Word has length 67 [2024-11-18 16:16:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1826 transitions. [2024-11-18 16:16:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 16:16:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1826 transitions. [2024-11-18 16:16:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:16:19,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:19,098 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 16:16:19,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -479367052, now seen corresponding path program 1 times [2024-11-18 16:16:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467777681] [2024-11-18 16:16:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 16:16:19,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:19,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467777681] [2024-11-18 16:16:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467777681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285066516] [2024-11-18 16:16:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:19,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:19,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 16:16:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:19,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 16:16:19,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:19,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:16:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285066516] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 16:16:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 16:16:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891950370] [2024-11-18 16:16:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:19,682 INFO L87 Difference]: Start difference. First operand 1362 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:20,033 INFO L93 Difference]: Finished difference Result 1418 states and 1894 transitions. [2024-11-18 16:16:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-18 16:16:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:20,043 INFO L225 Difference]: With dead ends: 1418 [2024-11-18 16:16:20,043 INFO L226 Difference]: Without dead ends: 1415 [2024-11-18 16:16:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:20,044 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 423 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:20,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 341 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:16:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-18 16:16:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1361. [2024-11-18 16:16:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1144 states have (on average 1.3312937062937062) internal successors, (1523), 1160 states have internal predecessors, (1523), 131 states have call successors, (131), 78 states have call predecessors, (131), 84 states have return successors, (169), 126 states have call predecessors, (169), 128 states have call successors, (169) [2024-11-18 16:16:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1823 transitions. [2024-11-18 16:16:20,114 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1823 transitions. Word has length 68 [2024-11-18 16:16:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:20,114 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1823 transitions. [2024-11-18 16:16:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1823 transitions. [2024-11-18 16:16:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 16:16:20,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:20,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:20,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 16:16:20,320 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,SelfDestructingSolverStorable10 [2024-11-18 16:16:20,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:20,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:20,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1976092431, now seen corresponding path program 1 times [2024-11-18 16:16:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092992428] [2024-11-18 16:16:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:20,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 16:16:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092992428] [2024-11-18 16:16:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092992428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446432995] [2024-11-18 16:16:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:20,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:20,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:20,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 16:16:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:20,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 16:16:20,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:20,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:16:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446432995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 16:16:20,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 16:16:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2024-11-18 16:16:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916352099] [2024-11-18 16:16:20,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 16:16:20,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 16:16:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 16:16:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:16:20,874 INFO L87 Difference]: Start difference. First operand 1361 states and 1823 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 16:16:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:21,389 INFO L93 Difference]: Finished difference Result 2705 states and 3607 transitions. [2024-11-18 16:16:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 16:16:21,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-18 16:16:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:21,410 INFO L225 Difference]: With dead ends: 2705 [2024-11-18 16:16:21,410 INFO L226 Difference]: Without dead ends: 2212 [2024-11-18 16:16:21,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-18 16:16:21,419 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 459 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:21,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 2051 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:16:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2024-11-18 16:16:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 1718. [2024-11-18 16:16:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1465 states have (on average 1.310580204778157) internal successors, (1920), 1486 states have internal predecessors, (1920), 151 states have call successors, (151), 92 states have call predecessors, (151), 100 states have return successors, (200), 143 states have call predecessors, (200), 148 states have call successors, (200) [2024-11-18 16:16:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2271 transitions. [2024-11-18 16:16:21,519 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2271 transitions. Word has length 69 [2024-11-18 16:16:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:21,520 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2271 transitions. [2024-11-18 16:16:21,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 16:16:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2271 transitions. [2024-11-18 16:16:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-18 16:16:21,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:21,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:21,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 16:16:21,740 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,SelfDestructingSolverStorable11 [2024-11-18 16:16:21,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1268414691, now seen corresponding path program 1 times [2024-11-18 16:16:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492123814] [2024-11-18 16:16:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 16:16:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492123814] [2024-11-18 16:16:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492123814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125148488] [2024-11-18 16:16:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:21,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:21,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:21,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:21,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 16:16:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:21,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:16:21,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:22,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125148488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422561354] [2024-11-18 16:16:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:22,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:22,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:22,112 INFO L87 Difference]: Start difference. First operand 1718 states and 2271 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 16:16:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:22,349 INFO L93 Difference]: Finished difference Result 2364 states and 3112 transitions. [2024-11-18 16:16:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-18 16:16:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:22,378 INFO L225 Difference]: With dead ends: 2364 [2024-11-18 16:16:22,385 INFO L226 Difference]: Without dead ends: 1600 [2024-11-18 16:16:22,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 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-11-18 16:16:22,396 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 210 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:22,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 355 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-18 16:16:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1585. [2024-11-18 16:16:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1346 states have (on average 1.3105497771173849) internal successors, (1764), 1368 states have internal predecessors, (1764), 143 states have call successors, (143), 86 states have call predecessors, (143), 94 states have return successors, (188), 134 states have call predecessors, (188), 140 states have call successors, (188) [2024-11-18 16:16:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2095 transitions. [2024-11-18 16:16:22,543 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2095 transitions. Word has length 88 [2024-11-18 16:16:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2095 transitions. [2024-11-18 16:16:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 16:16:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2095 transitions. [2024-11-18 16:16:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-18 16:16:22,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:22,548 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:22,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 16:16:22,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:22,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:22,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1078411284, now seen corresponding path program 1 times [2024-11-18 16:16:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682049983] [2024-11-18 16:16:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 16:16:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682049983] [2024-11-18 16:16:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682049983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872910623] [2024-11-18 16:16:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:22,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:22,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 16:16:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:22,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:22,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 16:16:22,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872910623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388705966] [2024-11-18 16:16:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:22,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:22,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:22,997 INFO L87 Difference]: Start difference. First operand 1585 states and 2095 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-18 16:16:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:23,111 INFO L93 Difference]: Finished difference Result 2117 states and 2852 transitions. [2024-11-18 16:16:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 94 [2024-11-18 16:16:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:23,119 INFO L225 Difference]: With dead ends: 2117 [2024-11-18 16:16:23,119 INFO L226 Difference]: Without dead ends: 1828 [2024-11-18 16:16:23,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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-11-18 16:16:23,121 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 106 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:23,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 600 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2024-11-18 16:16:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1828. [2024-11-18 16:16:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1541 states have (on average 1.318624269954575) internal successors, (2032), 1565 states have internal predecessors, (2032), 171 states have call successors, (171), 104 states have call predecessors, (171), 114 states have return successors, (229), 162 states have call predecessors, (229), 168 states have call successors, (229) [2024-11-18 16:16:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2432 transitions. [2024-11-18 16:16:23,216 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2432 transitions. Word has length 94 [2024-11-18 16:16:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:23,216 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2432 transitions. [2024-11-18 16:16:23,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-18 16:16:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2432 transitions. [2024-11-18 16:16:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 16:16:23,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:23,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:23,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 16:16:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:23,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1448889711, now seen corresponding path program 1 times [2024-11-18 16:16:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879399086] [2024-11-18 16:16:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 16:16:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879399086] [2024-11-18 16:16:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879399086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195916157] [2024-11-18 16:16:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:23,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 16:16:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:23,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:23,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 16:16:23,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195916157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997313490] [2024-11-18 16:16:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:23,738 INFO L87 Difference]: Start difference. First operand 1828 states and 2432 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 16:16:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:23,812 INFO L93 Difference]: Finished difference Result 2205 states and 2898 transitions. [2024-11-18 16:16:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-18 16:16:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:23,819 INFO L225 Difference]: With dead ends: 2205 [2024-11-18 16:16:23,819 INFO L226 Difference]: Without dead ends: 960 [2024-11-18 16:16:23,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 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-11-18 16:16:23,823 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 62 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:23,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 520 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-18 16:16:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-11-18 16:16:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 769 states have (on average 1.3862158647594278) internal successors, (1066), 784 states have internal predecessors, (1066), 114 states have call successors, (114), 67 states have call predecessors, (114), 76 states have return successors, (144), 112 states have call predecessors, (144), 112 states have call successors, (144) [2024-11-18 16:16:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1324 transitions. [2024-11-18 16:16:23,876 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1324 transitions. Word has length 103 [2024-11-18 16:16:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:23,876 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1324 transitions. [2024-11-18 16:16:23,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 16:16:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1324 transitions. [2024-11-18 16:16:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-18 16:16:23,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:23,878 INFO L215 NwaCegarLoop]: trace histogram [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-11-18 16:16:23,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 16:16:24,082 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,SelfDestructingSolverStorable14 [2024-11-18 16:16:24,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 157890568, now seen corresponding path program 1 times [2024-11-18 16:16:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842995557] [2024-11-18 16:16:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 16:16:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842995557] [2024-11-18 16:16:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842995557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272034901] [2024-11-18 16:16:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:24,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:24,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 16:16:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:24,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:24,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 16:16:24,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272034901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:24,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:24,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 16:16:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301864193] [2024-11-18 16:16:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:24,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:24,515 INFO L87 Difference]: Start difference. First operand 960 states and 1324 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-11-18 16:16:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:24,654 INFO L93 Difference]: Finished difference Result 2787 states and 3870 transitions. [2024-11-18 16:16:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 121 [2024-11-18 16:16:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:24,662 INFO L225 Difference]: With dead ends: 2787 [2024-11-18 16:16:24,662 INFO L226 Difference]: Without dead ends: 1838 [2024-11-18 16:16:24,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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-11-18 16:16:24,664 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 81 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:24,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 307 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-18 16:16:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1812. [2024-11-18 16:16:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1458 states have (on average 1.384087791495199) internal successors, (2018), 1486 states have internal predecessors, (2018), 206 states have call successors, (206), 128 states have call predecessors, (206), 147 states have return successors, (259), 201 states have call predecessors, (259), 204 states have call successors, (259) [2024-11-18 16:16:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2483 transitions. [2024-11-18 16:16:24,765 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2483 transitions. Word has length 121 [2024-11-18 16:16:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:24,765 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2483 transitions. [2024-11-18 16:16:24,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-11-18 16:16:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2483 transitions. [2024-11-18 16:16:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 16:16:24,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:24,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:24,783 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-11-18 16:16:24,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 16:16:24,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:24,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash 203579069, now seen corresponding path program 1 times [2024-11-18 16:16:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757999376] [2024-11-18 16:16:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 16:16:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757999376] [2024-11-18 16:16:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757999376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947654241] [2024-11-18 16:16:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:25,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:25,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 16:16:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:16:25,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-18 16:16:25,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947654241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207581143] [2024-11-18 16:16:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:25,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:25,166 INFO L87 Difference]: Start difference. First operand 1812 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-18 16:16:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:25,279 INFO L93 Difference]: Finished difference Result 3812 states and 5232 transitions. [2024-11-18 16:16:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 138 [2024-11-18 16:16:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:25,288 INFO L225 Difference]: With dead ends: 3812 [2024-11-18 16:16:25,289 INFO L226 Difference]: Without dead ends: 2012 [2024-11-18 16:16:25,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 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-11-18 16:16:25,293 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 103 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:25,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-11-18 16:16:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1994. [2024-11-18 16:16:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1616 states have (on average 1.3465346534653466) internal successors, (2176), 1644 states have internal predecessors, (2176), 212 states have call successors, (212), 146 states have call predecessors, (212), 165 states have return successors, (283), 207 states have call predecessors, (283), 210 states have call successors, (283) [2024-11-18 16:16:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2671 transitions. [2024-11-18 16:16:25,401 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2671 transitions. Word has length 138 [2024-11-18 16:16:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:25,401 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2671 transitions. [2024-11-18 16:16:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-11-18 16:16:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2671 transitions. [2024-11-18 16:16:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 16:16:25,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:25,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:25,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:25,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:25,609 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -580294405, now seen corresponding path program 1 times [2024-11-18 16:16:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855108069] [2024-11-18 16:16:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 16:16:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855108069] [2024-11-18 16:16:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855108069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792281999] [2024-11-18 16:16:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:25,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:25,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:25,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 16:16:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:25,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 16:16:25,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792281999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365434482] [2024-11-18 16:16:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:25,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:25,809 INFO L87 Difference]: Start difference. First operand 1994 states and 2671 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-11-18 16:16:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:26,326 INFO L93 Difference]: Finished difference Result 5798 states and 7838 transitions. [2024-11-18 16:16:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 139 [2024-11-18 16:16:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:26,363 INFO L225 Difference]: With dead ends: 5798 [2024-11-18 16:16:26,363 INFO L226 Difference]: Without dead ends: 3816 [2024-11-18 16:16:26,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 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-11-18 16:16:26,370 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 127 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:26,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 424 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2024-11-18 16:16:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3800. [2024-11-18 16:16:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3081 states have (on average 1.3362544628367412) internal successors, (4117), 3136 states have internal predecessors, (4117), 399 states have call successors, (399), 280 states have call predecessors, (399), 319 states have return successors, (610), 391 states have call predecessors, (610), 397 states have call successors, (610) [2024-11-18 16:16:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5126 transitions. [2024-11-18 16:16:26,761 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5126 transitions. Word has length 139 [2024-11-18 16:16:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 3800 states and 5126 transitions. [2024-11-18 16:16:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-11-18 16:16:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5126 transitions. [2024-11-18 16:16:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 16:16:26,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:26,767 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:26,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 16:16:26,974 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,SelfDestructingSolverStorable17 [2024-11-18 16:16:26,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:26,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash -29781420, now seen corresponding path program 1 times [2024-11-18 16:16:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339171162] [2024-11-18 16:16:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339171162] [2024-11-18 16:16:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339171162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206485578] [2024-11-18 16:16:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:27,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:27,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 16:16:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:27,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:16:27,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 16:16:27,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206485578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:27,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134786532] [2024-11-18 16:16:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:27,213 INFO L87 Difference]: Start difference. First operand 3800 states and 5126 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-18 16:16:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:27,458 INFO L93 Difference]: Finished difference Result 5792 states and 7974 transitions. [2024-11-18 16:16:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:27,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 140 [2024-11-18 16:16:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:27,475 INFO L225 Difference]: With dead ends: 5792 [2024-11-18 16:16:27,475 INFO L226 Difference]: Without dead ends: 3826 [2024-11-18 16:16:27,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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-11-18 16:16:27,481 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 112 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:27,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 383 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2024-11-18 16:16:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3800. [2024-11-18 16:16:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3081 states have (on average 1.318078545926647) internal successors, (4061), 3136 states have internal predecessors, (4061), 399 states have call successors, (399), 280 states have call predecessors, (399), 319 states have return successors, (610), 391 states have call predecessors, (610), 397 states have call successors, (610) [2024-11-18 16:16:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5070 transitions. [2024-11-18 16:16:27,739 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5070 transitions. Word has length 140 [2024-11-18 16:16:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:27,740 INFO L471 AbstractCegarLoop]: Abstraction has 3800 states and 5070 transitions. [2024-11-18 16:16:27,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-18 16:16:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5070 transitions. [2024-11-18 16:16:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 16:16:27,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:27,746 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:27,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 16:16:27,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:27,947 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash 19612246, now seen corresponding path program 1 times [2024-11-18 16:16:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059240177] [2024-11-18 16:16:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059240177] [2024-11-18 16:16:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059240177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887271829] [2024-11-18 16:16:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:28,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:28,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:28,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:28,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 16:16:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:28,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:28,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 16:16:28,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887271829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:28,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179815194] [2024-11-18 16:16:28,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:28,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:28,149 INFO L87 Difference]: Start difference. First operand 3800 states and 5070 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-11-18 16:16:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:28,759 INFO L93 Difference]: Finished difference Result 7268 states and 9830 transitions. [2024-11-18 16:16:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 140 [2024-11-18 16:16:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:28,779 INFO L225 Difference]: With dead ends: 7268 [2024-11-18 16:16:28,783 INFO L226 Difference]: Without dead ends: 3736 [2024-11-18 16:16:28,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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-11-18 16:16:28,795 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 132 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:28,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 180 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2024-11-18 16:16:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3504. [2024-11-18 16:16:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 2852 states have (on average 1.273842917251052) internal successors, (3633), 2891 states have internal predecessors, (3633), 369 states have call successors, (369), 259 states have call predecessors, (369), 282 states have return successors, (486), 357 states have call predecessors, (486), 367 states have call successors, (486) [2024-11-18 16:16:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 4488 transitions. [2024-11-18 16:16:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 4488 transitions. Word has length 140 [2024-11-18 16:16:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 3504 states and 4488 transitions. [2024-11-18 16:16:29,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-11-18 16:16:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4488 transitions. [2024-11-18 16:16:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 16:16:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:29,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:29,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 16:16:29,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:29,448 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:29,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash -819263655, now seen corresponding path program 1 times [2024-11-18 16:16:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128211641] [2024-11-18 16:16:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128211641] [2024-11-18 16:16:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128211641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476175784] [2024-11-18 16:16:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:29,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:29,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 16:16:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:29,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 16:16:29,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 16:16:29,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:29,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476175784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 16:16:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304842746] [2024-11-18 16:16:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:29,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:29,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:29,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:29,703 INFO L87 Difference]: Start difference. First operand 3504 states and 4488 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-11-18 16:16:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:29,948 INFO L93 Difference]: Finished difference Result 5696 states and 7387 transitions. [2024-11-18 16:16:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 141 [2024-11-18 16:16:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:29,967 INFO L225 Difference]: With dead ends: 5696 [2024-11-18 16:16:29,967 INFO L226 Difference]: Without dead ends: 3200 [2024-11-18 16:16:29,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:29,974 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 151 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:29,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 261 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2024-11-18 16:16:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2328. [2024-11-18 16:16:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1900 states have (on average 1.2426315789473685) internal successors, (2361), 1923 states have internal predecessors, (2361), 247 states have call successors, (247), 169 states have call predecessors, (247), 180 states have return successors, (315), 237 states have call predecessors, (315), 245 states have call successors, (315) [2024-11-18 16:16:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2923 transitions. [2024-11-18 16:16:30,151 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2923 transitions. Word has length 141 [2024-11-18 16:16:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:30,151 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 2923 transitions. [2024-11-18 16:16:30,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-11-18 16:16:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2923 transitions. [2024-11-18 16:16:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 16:16:30,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:30,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-18 16:16:30,355 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1442545257, now seen corresponding path program 1 times [2024-11-18 16:16:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445566900] [2024-11-18 16:16:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445566900] [2024-11-18 16:16:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445566900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495926125] [2024-11-18 16:16:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:30,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:30,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:30,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:30,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 16:16:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:30,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 16:16:30,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 16:16:30,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495926125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:30,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 16:16:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961202829] [2024-11-18 16:16:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:30,569 INFO L87 Difference]: Start difference. First operand 2328 states and 2923 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-11-18 16:16:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:30,889 INFO L93 Difference]: Finished difference Result 4794 states and 6152 transitions. [2024-11-18 16:16:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:16:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 141 [2024-11-18 16:16:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:30,911 INFO L225 Difference]: With dead ends: 4794 [2024-11-18 16:16:30,916 INFO L226 Difference]: Without dead ends: 2478 [2024-11-18 16:16:30,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:16:30,933 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 189 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:30,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 254 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2024-11-18 16:16:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2422. [2024-11-18 16:16:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 1988 states have (on average 1.1856136820925554) internal successors, (2357), 2011 states have internal predecessors, (2357), 247 states have call successors, (247), 175 states have call predecessors, (247), 186 states have return successors, (315), 237 states have call predecessors, (315), 245 states have call successors, (315) [2024-11-18 16:16:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2919 transitions. [2024-11-18 16:16:31,135 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2919 transitions. Word has length 141 [2024-11-18 16:16:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 2919 transitions. [2024-11-18 16:16:31,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-11-18 16:16:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2919 transitions. [2024-11-18 16:16:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 16:16:31,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:31,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:31,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-18 16:16:31,342 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1324103783, now seen corresponding path program 1 times [2024-11-18 16:16:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531689757] [2024-11-18 16:16:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531689757] [2024-11-18 16:16:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531689757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558536671] [2024-11-18 16:16:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:31,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:31,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:31,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-18 16:16:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:31,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 16:16:31,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 16:16:31,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:16:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558536671] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:31,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 16:16:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 16:16:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415743829] [2024-11-18 16:16:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:31,792 INFO L87 Difference]: Start difference. First operand 2422 states and 2919 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:16:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:32,141 INFO L93 Difference]: Finished difference Result 5859 states and 7027 transitions. [2024-11-18 16:16:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2024-11-18 16:16:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:32,156 INFO L225 Difference]: With dead ends: 5859 [2024-11-18 16:16:32,157 INFO L226 Difference]: Without dead ends: 4363 [2024-11-18 16:16:32,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 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-11-18 16:16:32,162 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 228 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:32,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 454 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2024-11-18 16:16:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3667. [2024-11-18 16:16:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 3009 states have (on average 1.1718178796942507) internal successors, (3526), 3040 states have internal predecessors, (3526), 375 states have call successors, (375), 263 states have call predecessors, (375), 282 states have return successors, (485), 365 states have call predecessors, (485), 373 states have call successors, (485) [2024-11-18 16:16:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4386 transitions. [2024-11-18 16:16:32,802 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4386 transitions. Word has length 141 [2024-11-18 16:16:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 4386 transitions. [2024-11-18 16:16:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:16:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4386 transitions. [2024-11-18 16:16:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 16:16:32,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:32,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:32,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-18 16:16:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-18 16:16:33,016 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash -304757055, now seen corresponding path program 1 times [2024-11-18 16:16:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92291254] [2024-11-18 16:16:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92291254] [2024-11-18 16:16:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92291254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244038580] [2024-11-18 16:16:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:33,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:33,119 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:33,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-18 16:16:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:33,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:33,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 16:16:33,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:33,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244038580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:33,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:33,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346553459] [2024-11-18 16:16:33,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:33,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:33,280 INFO L87 Difference]: Start difference. First operand 3667 states and 4386 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 16:16:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:33,658 INFO L93 Difference]: Finished difference Result 5732 states and 6877 transitions. [2024-11-18 16:16:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 145 [2024-11-18 16:16:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:33,684 INFO L225 Difference]: With dead ends: 5732 [2024-11-18 16:16:33,684 INFO L226 Difference]: Without dead ends: 3671 [2024-11-18 16:16:33,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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-11-18 16:16:33,701 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:33,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-18 16:16:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-11-18 16:16:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3013 states have (on average 1.1715897776302688) internal successors, (3530), 3044 states have internal predecessors, (3530), 375 states have call successors, (375), 263 states have call predecessors, (375), 282 states have return successors, (485), 365 states have call predecessors, (485), 373 states have call successors, (485) [2024-11-18 16:16:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4390 transitions. [2024-11-18 16:16:34,025 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4390 transitions. Word has length 145 [2024-11-18 16:16:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:34,026 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4390 transitions. [2024-11-18 16:16:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 16:16:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4390 transitions. [2024-11-18 16:16:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 16:16:34,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:34,031 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:34,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-18 16:16:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:34,236 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 371631204, now seen corresponding path program 1 times [2024-11-18 16:16:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079361070] [2024-11-18 16:16:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079361070] [2024-11-18 16:16:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079361070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823780598] [2024-11-18 16:16:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:34,326 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-18 16:16:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:34,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 16:16:34,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-18 16:16:34,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823780598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:34,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-18 16:16:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162408068] [2024-11-18 16:16:34,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:34,501 INFO L87 Difference]: Start difference. First operand 3671 states and 4390 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 16:16:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:34,676 INFO L93 Difference]: Finished difference Result 5572 states and 6711 transitions. [2024-11-18 16:16:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-18 16:16:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:34,686 INFO L225 Difference]: With dead ends: 5572 [2024-11-18 16:16:34,686 INFO L226 Difference]: Without dead ends: 2478 [2024-11-18 16:16:34,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:34,692 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:34,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2024-11-18 16:16:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2024-11-18 16:16:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2030 states have (on average 1.1448275862068966) internal successors, (2324), 2054 states have internal predecessors, (2324), 254 states have call successors, (254), 177 states have call predecessors, (254), 193 states have return successors, (292), 248 states have call predecessors, (292), 252 states have call successors, (292) [2024-11-18 16:16:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 2870 transitions. [2024-11-18 16:16:34,836 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 2870 transitions. Word has length 146 [2024-11-18 16:16:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:34,837 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 2870 transitions. [2024-11-18 16:16:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 16:16:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2870 transitions. [2024-11-18 16:16:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 16:16:34,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:34,840 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:34,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:35,044 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 740587940, now seen corresponding path program 1 times [2024-11-18 16:16:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457630237] [2024-11-18 16:16:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457630237] [2024-11-18 16:16:35,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457630237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119490163] [2024-11-18 16:16:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:35,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:35,166 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:35,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-18 16:16:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:35,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 16:16:35,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 16:16:35,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119490163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-18 16:16:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728591541] [2024-11-18 16:16:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:35,306 INFO L87 Difference]: Start difference. First operand 2478 states and 2870 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-18 16:16:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:35,408 INFO L93 Difference]: Finished difference Result 4208 states and 4904 transitions. [2024-11-18 16:16:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 146 [2024-11-18 16:16:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:35,428 INFO L225 Difference]: With dead ends: 4208 [2024-11-18 16:16:35,429 INFO L226 Difference]: Without dead ends: 808 [2024-11-18 16:16:35,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:35,449 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:35,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-18 16:16:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-18 16:16:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 662 states have (on average 1.1163141993957704) internal successors, (739), 669 states have internal predecessors, (739), 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-11-18 16:16:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 910 transitions. [2024-11-18 16:16:35,518 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 910 transitions. Word has length 146 [2024-11-18 16:16:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:35,519 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 910 transitions. [2024-11-18 16:16:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-18 16:16:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 910 transitions. [2024-11-18 16:16:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 16:16:35,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:35,520 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:35,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:35,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-18 16:16:35,724 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:35,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1364213856, now seen corresponding path program 1 times [2024-11-18 16:16:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008630033] [2024-11-18 16:16:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 16:16:35,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 16:16:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 16:16:35,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 16:16:35,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 16:16:35,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 16:16:35,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 16:16:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-18 16:16:35,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:35,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 16:16:35,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:16:35 BoogieIcfgContainer [2024-11-18 16:16:35,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 16:16:35,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 16:16:35,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 16:16:35,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 16:16:35,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:14" (3/4) ... [2024-11-18 16:16:35,982 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 16:16:36,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 16:16:36,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 16:16:36,080 INFO L158 Benchmark]: Toolchain (without parser) took 22838.39ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 106.2MB in the beginning and 874.4MB in the end (delta: -768.3MB). Peak memory consumption was 264.3MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,083 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 16:16:36,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.62ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 147.6MB in the end (delta: -41.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.95ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 147.6MB in the beginning and 256.6MB in the end (delta: -109.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,084 INFO L158 Benchmark]: Boogie Preprocessor took 65.59ms. Allocated memory is still 289.4MB. Free memory was 256.6MB in the beginning and 253.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,084 INFO L158 Benchmark]: RCFGBuilder took 576.40ms. Allocated memory is still 289.4MB. Free memory was 253.5MB in the beginning and 223.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,084 INFO L158 Benchmark]: TraceAbstraction took 21535.15ms. Allocated memory was 289.4MB in the beginning and 1.2GB in the end (delta: 920.6MB). Free memory was 222.0MB in the beginning and 894.6MB in the end (delta: -672.6MB). Peak memory consumption was 248.0MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,084 INFO L158 Benchmark]: Witness Printer took 98.87ms. Allocated memory is still 1.2GB. Free memory was 894.6MB in the beginning and 874.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 16:16:36,085 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.16ms. Allocated memory is still 180.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.62ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 147.6MB in the end (delta: -41.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.95ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 147.6MB in the beginning and 256.6MB in the end (delta: -109.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.59ms. Allocated memory is still 289.4MB. Free memory was 256.6MB in the beginning and 253.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.40ms. Allocated memory is still 289.4MB. Free memory was 253.5MB in the beginning and 223.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21535.15ms. Allocated memory was 289.4MB in the beginning and 1.2GB in the end (delta: 920.6MB). Free memory was 222.0MB in the beginning and 894.6MB in the end (delta: -672.6MB). Peak memory consumption was 248.0MB. Max. memory is 16.1GB. * Witness Printer took 98.87ms. Allocated memory is still 1.2GB. Free memory was 894.6MB in the beginning and 874.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L723] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L453] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: 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 11 procedures, 189 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4750 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4695 mSDsluCounter, 13417 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7305 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2086 IncrementalHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 6112 mSDtfsCounter, 2086 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2366 GetRequests, 2249 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3800occurred in iteration=18, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 2645 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4619 NumberOfCodeBlocks, 4619 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4706 ConstructedInterpolants, 0 QuantifiedInterpolants, 6512 SizeOfPredicates, 2 NumberOfNonLiveVariables, 6325 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 45 InterpolantComputations, 25 PerfectInterpolantSequences, 1927/2260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 16:16:36,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE