./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB --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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:09:30,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:09:30,258 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:09:30,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:09:30,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:09:30,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:09:30,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:09:30,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:09:30,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:09:30,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:09:30,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:09:30,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:09:30,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:09:30,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:09:30,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:09:30,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:09:30,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:09:30,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:09:30,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:09:30,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:09:30,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:30,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:09:30,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:09:30,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:09:30,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:09:30,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:30,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:09:30,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:09:30,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:09:30,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:09:30,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:09:30,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:09:30,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:09:30,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:09:30,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:09:30,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:09:30,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2024-11-27 20:09:30,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:09:30,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:09:30,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:09:30,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:09:30,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:09:30,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-27 20:09:34,155 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/data/f49e21a61/b9bea94acdb04d8ba9d810ba0e51b5e0/FLAGc72954d08 [2024-11-27 20:09:34,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:09:34,614 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-27 20:09:34,642 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/data/f49e21a61/b9bea94acdb04d8ba9d810ba0e51b5e0/FLAGc72954d08 [2024-11-27 20:09:34,678 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/data/f49e21a61/b9bea94acdb04d8ba9d810ba0e51b5e0 [2024-11-27 20:09:34,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:09:34,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:09:34,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:34,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:09:34,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:09:34,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:34" (1/1) ... [2024-11-27 20:09:34,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c35f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:34, skipping insertion in model container [2024-11-27 20:09:34,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:34" (1/1) ... [2024-11-27 20:09:34,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:09:34,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2024-11-27 20:09:35,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:35,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:09:35,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2024-11-27 20:09:35,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:35,396 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:09:35,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35 WrapperNode [2024-11-27 20:09:35,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:35,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:35,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:09:35,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:09:35,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,462 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 834 [2024-11-27 20:09:35,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:35,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:09:35,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:09:35,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:09:35,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,507 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-27 20:09:35,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:09:35,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:09:35,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:09:35,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:09:35,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:35,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:35,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:09:35,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:09:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:09:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:09:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-27 20:09:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-27 20:09:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:09:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:09:35,759 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:09:35,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:09:37,053 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-27 20:09:37,057 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:09:37,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:09:37,088 INFO L312 CfgBuilder]: Removed 26 assume(true) statements. [2024-11-27 20:09:37,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:37 BoogieIcfgContainer [2024-11-27 20:09:37,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:09:37,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:09:37,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:09:37,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:09:37,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:09:34" (1/3) ... [2024-11-27 20:09:37,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aab2c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:37, skipping insertion in model container [2024-11-27 20:09:37,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35" (2/3) ... [2024-11-27 20:09:37,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aab2c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:37, skipping insertion in model container [2024-11-27 20:09:37,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:37" (3/3) ... [2024-11-27 20:09:37,102 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-11-27 20:09:37,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:09:37,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 259 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2024-11-27 20:09:37,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:09:37,258 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;@288664af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:09:37,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:09:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 251 states have (on average 1.8924302788844622) internal successors, (475), 257 states have internal predecessors, (475), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:09:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 20:09:37,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:37,280 INFO L218 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] [2024-11-27 20:09:37,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 17693760, now seen corresponding path program 1 times [2024-11-27 20:09:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505939942] [2024-11-27 20:09:37,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:37,604 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-27 20:09:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:37,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505939942] [2024-11-27 20:09:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505939942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39703805] [2024-11-27 20:09:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:37,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:37,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:37,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:37,649 INFO L87 Difference]: Start difference. First operand has 259 states, 251 states have (on average 1.8924302788844622) internal successors, (475), 257 states have internal predecessors, (475), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:38,291 INFO L93 Difference]: Finished difference Result 676 states and 1269 transitions. [2024-11-27 20:09:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-27 20:09:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:38,307 INFO L225 Difference]: With dead ends: 676 [2024-11-27 20:09:38,307 INFO L226 Difference]: Without dead ends: 414 [2024-11-27 20:09:38,319 INFO L434 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-27 20:09:38,323 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 243 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:38,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 729 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:09:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-27 20:09:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 401. [2024-11-27 20:09:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 395 states have (on average 1.6253164556962025) internal successors, (642), 399 states have internal predecessors, (642), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 647 transitions. [2024-11-27 20:09:38,426 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 647 transitions. Word has length 26 [2024-11-27 20:09:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:38,427 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 647 transitions. [2024-11-27 20:09:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 647 transitions. [2024-11-27 20:09:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:09:38,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:38,435 INFO L218 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] [2024-11-27 20:09:38,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:09:38,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1059229402, now seen corresponding path program 1 times [2024-11-27 20:09:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031560957] [2024-11-27 20:09:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:38,571 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-27 20:09:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031560957] [2024-11-27 20:09:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031560957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418571572] [2024-11-27 20:09:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:38,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:38,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:38,575 INFO L87 Difference]: Start difference. First operand 401 states and 647 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:38,869 INFO L93 Difference]: Finished difference Result 1049 states and 1717 transitions. [2024-11-27 20:09:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-27 20:09:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:38,880 INFO L225 Difference]: With dead ends: 1049 [2024-11-27 20:09:38,880 INFO L226 Difference]: Without dead ends: 662 [2024-11-27 20:09:38,882 INFO L434 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-27 20:09:38,886 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 308 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:38,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 976 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:09:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-27 20:09:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 649. [2024-11-27 20:09:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.6609642301710732) internal successors, (1068), 647 states have internal predecessors, (1068), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1073 transitions. [2024-11-27 20:09:38,966 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1073 transitions. Word has length 34 [2024-11-27 20:09:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1073 transitions. [2024-11-27 20:09:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1073 transitions. [2024-11-27 20:09:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:09:38,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:38,969 INFO L218 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] [2024-11-27 20:09:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:09:38,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1493672269, now seen corresponding path program 1 times [2024-11-27 20:09:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476772088] [2024-11-27 20:09:38,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:39,179 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-27 20:09:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476772088] [2024-11-27 20:09:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476772088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767624686] [2024-11-27 20:09:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:39,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:39,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:39,185 INFO L87 Difference]: Start difference. First operand 649 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:39,285 INFO L93 Difference]: Finished difference Result 1629 states and 2704 transitions. [2024-11-27 20:09:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-27 20:09:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:39,294 INFO L225 Difference]: With dead ends: 1629 [2024-11-27 20:09:39,295 INFO L226 Difference]: Without dead ends: 1005 [2024-11-27 20:09:39,300 INFO L434 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-27 20:09:39,301 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 336 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:39,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 791 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-11-27 20:09:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 994. [2024-11-27 20:09:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.6619433198380567) internal successors, (1642), 992 states have internal predecessors, (1642), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1647 transitions. [2024-11-27 20:09:39,391 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1647 transitions. Word has length 35 [2024-11-27 20:09:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:39,391 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1647 transitions. [2024-11-27 20:09:39,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1647 transitions. [2024-11-27 20:09:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 20:09:39,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:39,395 INFO L218 NwaCegarLoop]: trace histogram [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-27 20:09:39,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:09:39,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:39,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1024558736, now seen corresponding path program 1 times [2024-11-27 20:09:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776590694] [2024-11-27 20:09:39,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776590694] [2024-11-27 20:09:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776590694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673804886] [2024-11-27 20:09:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:39,618 INFO L87 Difference]: Start difference. First operand 994 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:40,339 INFO L93 Difference]: Finished difference Result 2724 states and 4497 transitions. [2024-11-27 20:09:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:09:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-27 20:09:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:40,354 INFO L225 Difference]: With dead ends: 2724 [2024-11-27 20:09:40,354 INFO L226 Difference]: Without dead ends: 1755 [2024-11-27 20:09:40,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:40,358 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 556 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:40,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1474 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:09:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2024-11-27 20:09:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1534. [2024-11-27 20:09:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1528 states have (on average 1.638743455497382) internal successors, (2504), 1532 states have internal predecessors, (2504), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2509 transitions. [2024-11-27 20:09:40,492 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2509 transitions. Word has length 42 [2024-11-27 20:09:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:40,493 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2509 transitions. [2024-11-27 20:09:40,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2509 transitions. [2024-11-27 20:09:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:09:40,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:40,498 INFO L218 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] [2024-11-27 20:09:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:09:40,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1113831271, now seen corresponding path program 1 times [2024-11-27 20:09:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873827833] [2024-11-27 20:09:40,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:40,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873827833] [2024-11-27 20:09:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873827833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:40,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50559053] [2024-11-27 20:09:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:40,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:40,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:40,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:40,634 INFO L87 Difference]: Start difference. First operand 1534 states and 2509 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:40,788 INFO L93 Difference]: Finished difference Result 3639 states and 5941 transitions. [2024-11-27 20:09:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-27 20:09:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:40,802 INFO L225 Difference]: With dead ends: 3639 [2024-11-27 20:09:40,802 INFO L226 Difference]: Without dead ends: 2130 [2024-11-27 20:09:40,805 INFO L434 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-27 20:09:40,806 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 357 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:40,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 678 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2024-11-27 20:09:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2040. [2024-11-27 20:09:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2034 states have (on average 1.6194690265486726) internal successors, (3294), 2038 states have internal predecessors, (3294), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3299 transitions. [2024-11-27 20:09:40,975 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3299 transitions. Word has length 47 [2024-11-27 20:09:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:40,977 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3299 transitions. [2024-11-27 20:09:40,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3299 transitions. [2024-11-27 20:09:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-27 20:09:40,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:40,980 INFO L218 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] [2024-11-27 20:09:40,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:09:40,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:40,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash -931447891, now seen corresponding path program 1 times [2024-11-27 20:09:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645202323] [2024-11-27 20:09:40,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,128 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-27 20:09:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645202323] [2024-11-27 20:09:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645202323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400913302] [2024-11-27 20:09:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:41,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:41,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:41,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:41,131 INFO L87 Difference]: Start difference. First operand 2040 states and 3299 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:41,720 INFO L93 Difference]: Finished difference Result 4912 states and 8021 transitions. [2024-11-27 20:09:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-27 20:09:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:41,741 INFO L225 Difference]: With dead ends: 4912 [2024-11-27 20:09:41,742 INFO L226 Difference]: Without dead ends: 2897 [2024-11-27 20:09:41,746 INFO L434 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-27 20:09:41,748 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 231 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:41,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 858 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2024-11-27 20:09:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2480. [2024-11-27 20:09:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2474 states have (on average 1.564672594987874) internal successors, (3871), 2478 states have internal predecessors, (3871), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3876 transitions. [2024-11-27 20:09:41,927 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3876 transitions. Word has length 51 [2024-11-27 20:09:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:41,927 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3876 transitions. [2024-11-27 20:09:41,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3876 transitions. [2024-11-27 20:09:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 20:09:41,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:41,932 INFO L218 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] [2024-11-27 20:09:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:09:41,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -98898813, now seen corresponding path program 1 times [2024-11-27 20:09:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170464098] [2024-11-27 20:09:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:42,070 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-27 20:09:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170464098] [2024-11-27 20:09:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170464098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988250176] [2024-11-27 20:09:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:42,072 INFO L87 Difference]: Start difference. First operand 2480 states and 3876 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:42,239 INFO L93 Difference]: Finished difference Result 4702 states and 7445 transitions. [2024-11-27 20:09:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-27 20:09:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:42,251 INFO L225 Difference]: With dead ends: 4702 [2024-11-27 20:09:42,251 INFO L226 Difference]: Without dead ends: 2247 [2024-11-27 20:09:42,255 INFO L434 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-27 20:09:42,258 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 153 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:42,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 899 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-27 20:09:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1892. [2024-11-27 20:09:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1886 states have (on average 1.5938494167550372) internal successors, (3006), 1890 states have internal predecessors, (3006), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3011 transitions. [2024-11-27 20:09:42,364 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3011 transitions. Word has length 53 [2024-11-27 20:09:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:42,365 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 3011 transitions. [2024-11-27 20:09:42,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3011 transitions. [2024-11-27 20:09:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 20:09:42,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:42,369 INFO L218 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] [2024-11-27 20:09:42,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:09:42,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1184406847, now seen corresponding path program 1 times [2024-11-27 20:09:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592082752] [2024-11-27 20:09:42,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:42,498 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-27 20:09:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592082752] [2024-11-27 20:09:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592082752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968858480] [2024-11-27 20:09:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:42,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:42,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:42,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:42,502 INFO L87 Difference]: Start difference. First operand 1892 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:42,632 INFO L93 Difference]: Finished difference Result 3600 states and 5752 transitions. [2024-11-27 20:09:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-27 20:09:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:42,641 INFO L225 Difference]: With dead ends: 3600 [2024-11-27 20:09:42,641 INFO L226 Difference]: Without dead ends: 1851 [2024-11-27 20:09:42,644 INFO L434 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-27 20:09:42,644 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 335 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:42,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 426 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-27 20:09:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1851. [2024-11-27 20:09:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1845 states have (on average 1.5636856368563685) internal successors, (2885), 1849 states have internal predecessors, (2885), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2890 transitions. [2024-11-27 20:09:42,746 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2890 transitions. Word has length 53 [2024-11-27 20:09:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 2890 transitions. [2024-11-27 20:09:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2890 transitions. [2024-11-27 20:09:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-27 20:09:42,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:42,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:09:42,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1785927510, now seen corresponding path program 1 times [2024-11-27 20:09:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136329581] [2024-11-27 20:09:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:42,968 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-27 20:09:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136329581] [2024-11-27 20:09:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136329581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:09:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864228836] [2024-11-27 20:09:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:42,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:09:42,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:42,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:09:42,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:09:42,975 INFO L87 Difference]: Start difference. First operand 1851 states and 2890 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:43,778 INFO L93 Difference]: Finished difference Result 5053 states and 7868 transitions. [2024-11-27 20:09:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:09:43,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-27 20:09:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:43,795 INFO L225 Difference]: With dead ends: 5053 [2024-11-27 20:09:43,795 INFO L226 Difference]: Without dead ends: 3345 [2024-11-27 20:09:43,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:09:43,799 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 906 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:43,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2326 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:09:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2024-11-27 20:09:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 2328. [2024-11-27 20:09:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2322 states have (on average 1.5628768303186908) internal successors, (3629), 2326 states have internal predecessors, (3629), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3634 transitions. [2024-11-27 20:09:43,949 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3634 transitions. Word has length 56 [2024-11-27 20:09:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 3634 transitions. [2024-11-27 20:09:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3634 transitions. [2024-11-27 20:09:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-27 20:09:43,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:43,953 INFO L218 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] [2024-11-27 20:09:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:09:43,953 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -459694818, now seen corresponding path program 1 times [2024-11-27 20:09:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709656865] [2024-11-27 20:09:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:44,169 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-27 20:09:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709656865] [2024-11-27 20:09:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709656865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:44,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:09:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504074666] [2024-11-27 20:09:44,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:44,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:44,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:44,172 INFO L87 Difference]: Start difference. First operand 2328 states and 3634 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:44,592 INFO L93 Difference]: Finished difference Result 3400 states and 5225 transitions. [2024-11-27 20:09:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:09:44,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-27 20:09:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:44,609 INFO L225 Difference]: With dead ends: 3400 [2024-11-27 20:09:44,609 INFO L226 Difference]: Without dead ends: 3397 [2024-11-27 20:09:44,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:09:44,612 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 801 mSDsluCounter, 2317 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:44,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2842 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:09:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-11-27 20:09:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 2513. [2024-11-27 20:09:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2507 states have (on average 1.550857598723574) internal successors, (3888), 2511 states have internal predecessors, (3888), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3893 transitions. [2024-11-27 20:09:44,807 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3893 transitions. Word has length 57 [2024-11-27 20:09:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:44,807 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3893 transitions. [2024-11-27 20:09:44,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3893 transitions. [2024-11-27 20:09:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 20:09:44,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:44,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:09:44,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1473612459, now seen corresponding path program 1 times [2024-11-27 20:09:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991727802] [2024-11-27 20:09:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991727802] [2024-11-27 20:09:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991727802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702943838] [2024-11-27 20:09:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:44,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:44,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:44,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:44,863 INFO L87 Difference]: Start difference. First operand 2513 states and 3893 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:45,120 INFO L93 Difference]: Finished difference Result 5455 states and 8415 transitions. [2024-11-27 20:09:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:45,121 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-27 20:09:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:45,136 INFO L225 Difference]: With dead ends: 5455 [2024-11-27 20:09:45,137 INFO L226 Difference]: Without dead ends: 2961 [2024-11-27 20:09:45,141 INFO L434 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-27 20:09:45,142 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 121 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:45,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 777 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-11-27 20:09:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2903. [2024-11-27 20:09:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2897 states have (on average 1.5305488436313428) internal successors, (4434), 2901 states have internal predecessors, (4434), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4439 transitions. [2024-11-27 20:09:45,324 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4439 transitions. Word has length 70 [2024-11-27 20:09:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:45,324 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 4439 transitions. [2024-11-27 20:09:45,324 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4439 transitions. [2024-11-27 20:09:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-27 20:09:45,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:45,328 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-27 20:09:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:09:45,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1892138261, now seen corresponding path program 1 times [2024-11-27 20:09:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:45,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734645022] [2024-11-27 20:09:45,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734645022] [2024-11-27 20:09:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734645022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996606532] [2024-11-27 20:09:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:45,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:45,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:45,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:45,476 INFO L87 Difference]: Start difference. First operand 2903 states and 4439 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:46,172 INFO L93 Difference]: Finished difference Result 7550 states and 11485 transitions. [2024-11-27 20:09:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-27 20:09:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:46,213 INFO L225 Difference]: With dead ends: 7550 [2024-11-27 20:09:46,217 INFO L226 Difference]: Without dead ends: 4572 [2024-11-27 20:09:46,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:46,224 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 651 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:46,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1168 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2024-11-27 20:09:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3998. [2024-11-27 20:09:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3998 states, 3992 states have (on average 1.5157815631262526) internal successors, (6051), 3996 states have internal predecessors, (6051), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 6056 transitions. [2024-11-27 20:09:46,523 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 6056 transitions. Word has length 80 [2024-11-27 20:09:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:46,524 INFO L471 AbstractCegarLoop]: Abstraction has 3998 states and 6056 transitions. [2024-11-27 20:09:46,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 6056 transitions. [2024-11-27 20:09:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-27 20:09:46,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:46,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:46,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:09:46,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2114408446, now seen corresponding path program 1 times [2024-11-27 20:09:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937683969] [2024-11-27 20:09:46,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937683969] [2024-11-27 20:09:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937683969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171977813] [2024-11-27 20:09:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:46,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:46,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:46,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:46,669 INFO L87 Difference]: Start difference. First operand 3998 states and 6056 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:46,933 INFO L93 Difference]: Finished difference Result 6961 states and 10497 transitions. [2024-11-27 20:09:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-27 20:09:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:46,952 INFO L225 Difference]: With dead ends: 6961 [2024-11-27 20:09:46,953 INFO L226 Difference]: Without dead ends: 2967 [2024-11-27 20:09:46,958 INFO L434 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-27 20:09:46,959 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 324 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:46,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 485 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-11-27 20:09:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2922. [2024-11-27 20:09:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2916 states have (on average 1.3868312757201646) internal successors, (4044), 2920 states have internal predecessors, (4044), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 4049 transitions. [2024-11-27 20:09:47,136 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 4049 transitions. Word has length 87 [2024-11-27 20:09:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:47,136 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 4049 transitions. [2024-11-27 20:09:47,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4049 transitions. [2024-11-27 20:09:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:09:47,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:47,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:47,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:09:47,139 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2039717645, now seen corresponding path program 1 times [2024-11-27 20:09:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495354355] [2024-11-27 20:09:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:47,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495354355] [2024-11-27 20:09:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495354355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:09:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718469553] [2024-11-27 20:09:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:47,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:47,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:47,272 INFO L87 Difference]: Start difference. First operand 2922 states and 4049 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:47,603 INFO L93 Difference]: Finished difference Result 6653 states and 9220 transitions. [2024-11-27 20:09:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:09:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-27 20:09:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:47,618 INFO L225 Difference]: With dead ends: 6653 [2024-11-27 20:09:47,618 INFO L226 Difference]: Without dead ends: 3887 [2024-11-27 20:09:47,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:47,624 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 517 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:47,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2256 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2024-11-27 20:09:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 2924. [2024-11-27 20:09:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2918 states have (on average 1.3845099383139137) internal successors, (4040), 2922 states have internal predecessors, (4040), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4045 transitions. [2024-11-27 20:09:47,812 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4045 transitions. Word has length 90 [2024-11-27 20:09:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:47,813 INFO L471 AbstractCegarLoop]: Abstraction has 2924 states and 4045 transitions. [2024-11-27 20:09:47,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4045 transitions. [2024-11-27 20:09:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:09:47,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:47,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:47,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:09:47,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:47,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1343320238, now seen corresponding path program 1 times [2024-11-27 20:09:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622164451] [2024-11-27 20:09:47,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622164451] [2024-11-27 20:09:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622164451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533309787] [2024-11-27 20:09:47,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:47,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:47,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:09:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:48,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:09:48,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:09:48,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533309787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:48,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:09:48,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-27 20:09:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963014066] [2024-11-27 20:09:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:48,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:48,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:48,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:09:48,326 INFO L87 Difference]: Start difference. First operand 2924 states and 4045 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:48,507 INFO L93 Difference]: Finished difference Result 3523 states and 4850 transitions. [2024-11-27 20:09:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-27 20:09:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:48,520 INFO L225 Difference]: With dead ends: 3523 [2024-11-27 20:09:48,520 INFO L226 Difference]: Without dead ends: 3519 [2024-11-27 20:09:48,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-27 20:09:48,523 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 219 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:48,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 757 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2024-11-27 20:09:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3469. [2024-11-27 20:09:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3463 states have (on average 1.3765521224371933) internal successors, (4767), 3467 states have internal predecessors, (4767), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4772 transitions. [2024-11-27 20:09:48,731 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4772 transitions. Word has length 92 [2024-11-27 20:09:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:48,732 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 4772 transitions. [2024-11-27 20:09:48,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4772 transitions. [2024-11-27 20:09:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-27 20:09:48,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:48,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:09:48,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:09:48,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:48,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1552601868, now seen corresponding path program 1 times [2024-11-27 20:09:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983907489] [2024-11-27 20:09:48,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983907489] [2024-11-27 20:09:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983907489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487698229] [2024-11-27 20:09:49,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:49,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:49,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:49,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:09:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:49,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:09:49,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:09:49,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487698229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:09:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-27 20:09:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144227359] [2024-11-27 20:09:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:49,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:49,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:49,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:09:49,480 INFO L87 Difference]: Start difference. First operand 3469 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:49,673 INFO L93 Difference]: Finished difference Result 6192 states and 8554 transitions. [2024-11-27 20:09:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-11-27 20:09:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:49,684 INFO L225 Difference]: With dead ends: 6192 [2024-11-27 20:09:49,685 INFO L226 Difference]: Without dead ends: 2730 [2024-11-27 20:09:49,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:09:49,692 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 248 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:49,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 402 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2024-11-27 20:09:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2537. [2024-11-27 20:09:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2531 states have (on average 1.3472935598577638) internal successors, (3410), 2535 states have internal predecessors, (3410), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3415 transitions. [2024-11-27 20:09:49,834 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3415 transitions. Word has length 139 [2024-11-27 20:09:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:49,835 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3415 transitions. [2024-11-27 20:09:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3415 transitions. [2024-11-27 20:09:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-27 20:09:49,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:49,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:09:49,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:09:50,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 20:09:50,040 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:50,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1935872866, now seen corresponding path program 1 times [2024-11-27 20:09:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871334635] [2024-11-27 20:09:50,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:09:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871334635] [2024-11-27 20:09:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871334635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431515153] [2024-11-27 20:09:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:50,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:50,206 INFO L87 Difference]: Start difference. First operand 2537 states and 3415 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:50,492 INFO L93 Difference]: Finished difference Result 3075 states and 4096 transitions. [2024-11-27 20:09:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-11-27 20:09:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:50,503 INFO L225 Difference]: With dead ends: 3075 [2024-11-27 20:09:50,503 INFO L226 Difference]: Without dead ends: 588 [2024-11-27 20:09:50,506 INFO L434 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-27 20:09:50,507 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 124 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 354 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:09:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-27 20:09:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 580. [2024-11-27 20:09:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 576 states have (on average 1.0868055555555556) internal successors, (626), 578 states have internal predecessors, (626), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 629 transitions. [2024-11-27 20:09:50,544 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 629 transitions. Word has length 142 [2024-11-27 20:09:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 629 transitions. [2024-11-27 20:09:50,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 629 transitions. [2024-11-27 20:09:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-27 20:09:50,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:50,548 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:50,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:09:50,548 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1843508891, now seen corresponding path program 1 times [2024-11-27 20:09:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646327766] [2024-11-27 20:09:50,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:09:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646327766] [2024-11-27 20:09:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646327766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210933022] [2024-11-27 20:09:50,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:50,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:50,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:50,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:09:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:09:51,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:09:51,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210933022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:51,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:09:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-27 20:09:51,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691200811] [2024-11-27 20:09:51,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:51,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:51,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:51,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:51,336 INFO L87 Difference]: Start difference. First operand 580 states and 629 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:51,448 INFO L93 Difference]: Finished difference Result 848 states and 919 transitions. [2024-11-27 20:09:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-11-27 20:09:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:51,453 INFO L225 Difference]: With dead ends: 848 [2024-11-27 20:09:51,453 INFO L226 Difference]: Without dead ends: 493 [2024-11-27 20:09:51,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:09:51,455 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 211 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:51,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 390 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-27 20:09:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2024-11-27 20:09:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 489 states have (on average 1.0838445807770962) internal successors, (530), 491 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 533 transitions. [2024-11-27 20:09:51,511 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 533 transitions. Word has length 146 [2024-11-27 20:09:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:51,511 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 533 transitions. [2024-11-27 20:09:51,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 533 transitions. [2024-11-27 20:09:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-27 20:09:51,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:51,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:09:51,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:51,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 20:09:51,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:51,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash 337080125, now seen corresponding path program 1 times [2024-11-27 20:09:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409389964] [2024-11-27 20:09:51,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:09:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409389964] [2024-11-27 20:09:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409389964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:09:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122392187] [2024-11-27 20:09:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:51,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:51,983 INFO L87 Difference]: Start difference. First operand 493 states and 533 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:52,163 INFO L93 Difference]: Finished difference Result 501 states and 540 transitions. [2024-11-27 20:09:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:09:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-27 20:09:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:52,167 INFO L225 Difference]: With dead ends: 501 [2024-11-27 20:09:52,168 INFO L226 Difference]: Without dead ends: 498 [2024-11-27 20:09:52,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:09:52,169 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 193 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:52,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1153 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-27 20:09:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2024-11-27 20:09:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 489 states have (on average 1.0797546012269938) internal successors, (528), 490 states have internal predecessors, (528), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 530 transitions. [2024-11-27 20:09:52,200 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 530 transitions. Word has length 147 [2024-11-27 20:09:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:52,201 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 530 transitions. [2024-11-27 20:09:52,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 530 transitions. [2024-11-27 20:09:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-27 20:09:52,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:52,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:09:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:09:52,204 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1870676503, now seen corresponding path program 1 times [2024-11-27 20:09:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982162848] [2024-11-27 20:09:52,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:09:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982162848] [2024-11-27 20:09:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982162848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:09:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431858057] [2024-11-27 20:09:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:52,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:52,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:52,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:52,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:52,354 INFO L87 Difference]: Start difference. First operand 492 states and 530 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:52,445 INFO L93 Difference]: Finished difference Result 585 states and 626 transitions. [2024-11-27 20:09:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:09:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-11-27 20:09:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:52,449 INFO L225 Difference]: With dead ends: 585 [2024-11-27 20:09:52,449 INFO L226 Difference]: Without dead ends: 487 [2024-11-27 20:09:52,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:52,450 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 147 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:52,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 740 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-27 20:09:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2024-11-27 20:09:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 1.0683229813664596) internal successors, (516), 483 states have internal predecessors, (516), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 517 transitions. [2024-11-27 20:09:52,484 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 517 transitions. Word has length 148 [2024-11-27 20:09:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 517 transitions. [2024-11-27 20:09:52,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 517 transitions. [2024-11-27 20:09:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-27 20:09:52,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:52,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:09:52,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:09:52,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:52,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2060875229, now seen corresponding path program 1 times [2024-11-27 20:09:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517222557] [2024-11-27 20:09:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517222557] [2024-11-27 20:09:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517222557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867191202] [2024-11-27 20:09:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:53,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:53,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:53,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:09:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:53,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-27 20:09:53,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:54,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867191202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:55,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2024-11-27 20:09:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040593306] [2024-11-27 20:09:55,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:55,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-27 20:09:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-27 20:09:55,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2024-11-27 20:09:55,128 INFO L87 Difference]: Start difference. First operand 485 states and 517 transitions. Second operand has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:56,007 INFO L93 Difference]: Finished difference Result 491 states and 523 transitions. [2024-11-27 20:09:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-27 20:09:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-11-27 20:09:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:56,009 INFO L225 Difference]: With dead ends: 491 [2024-11-27 20:09:56,009 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 20:09:56,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-11-27 20:09:56,012 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 412 mSDsluCounter, 5217 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 5503 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:56,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 5503 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 20:09:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 20:09:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 20:09:56,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2024-11-27 20:09:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:56,016 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 20:09:56,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 20:09:56,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 20:09:56,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:09:56,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:09:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:56,226 INFO L422 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] [2024-11-27 20:09:56,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 20:10:10,069 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:10:10,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:10:10 BoogieIcfgContainer [2024-11-27 20:10:10,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:10:10,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:10:10,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:10:10,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:10:10,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:37" (3/4) ... [2024-11-27 20:10:10,167 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 20:10:10,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-27 20:10:10,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-27 20:10:10,207 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 20:10:10,208 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 20:10:10,210 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 20:10:10,467 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:10:10,472 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:10:10,472 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:10:10,473 INFO L158 Benchmark]: Toolchain (without parser) took 35785.77ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 106.3MB in the beginning and 541.5MB in the end (delta: -435.2MB). Peak memory consumption was 267.9MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,473 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:10:10,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.29ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 85.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.86ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,474 INFO L158 Benchmark]: Boogie Preprocessor took 83.12ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 78.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:10:10,474 INFO L158 Benchmark]: RCFGBuilder took 1541.67ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 98.0MB in the end (delta: -19.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,479 INFO L158 Benchmark]: TraceAbstraction took 33067.29ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 98.0MB in the beginning and 554.1MB in the end (delta: -456.0MB). Peak memory consumption was 491.0MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,479 INFO L158 Benchmark]: Witness Printer took 312.79ms. Allocated memory is still 847.2MB. Free memory was 554.1MB in the beginning and 541.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:10:10,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.29ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 85.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.86ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.12ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 78.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1541.67ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 98.0MB in the end (delta: -19.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33067.29ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 98.0MB in the beginning and 554.1MB in the end (delta: -456.0MB). Peak memory consumption was 491.0MB. Max. memory is 16.1GB. * Witness Printer took 312.79ms. Allocated memory is still 847.2MB. Free memory was 554.1MB in the beginning and 541.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 259 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7393 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7393 mSDsluCounter, 25984 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16890 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2477 IncrementalHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 9094 mSDtfsCounter, 2477 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 821 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3998occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 4920 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2558 ConstructedInterpolants, 0 QuantifiedInterpolants, 6536 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2038 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 271/416 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (0 <= a)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_d == 50))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (c_req_d == 50))) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (c_req_d == 50)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_d == 50))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) RESULT: Ultimate proved your program to be correct! [2024-11-27 20:10:10,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b88290-cfb9-48ca-a080-fc027588f172/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE