./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ --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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:35:50,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:35:50,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:35:50,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:35:50,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:35:50,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:35:50,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:35:50,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:35:50,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:35:50,691 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:35:50,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:35:50,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:35:50,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:35:50,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:35:50,697 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:35:50,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:35:50,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:35:50,698 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:35:50,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:35:50,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:35:50,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:35:50,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:35:50,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:35:50,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:35:50,704 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:35:50,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:35:50,705 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:35:50,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:35:50,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:35:50,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:35:50,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:35:50,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:35:50,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:35:50,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:35:50,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:35:50,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:35:50,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:35:50,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:35:50,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:35:50,712 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:35:50,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:35:50,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:35:50,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2023-11-23 22:35:51,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:35:51,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:35:51,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:35:51,079 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:35:51,080 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:35:51,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2023-11-23 22:35:54,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:35:54,852 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:35:54,855 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2023-11-23 22:35:54,876 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/data/488b095ee/fc0797812efd4944a4e64b8495787b6b/FLAGe3cb1a125 [2023-11-23 22:35:54,897 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/data/488b095ee/fc0797812efd4944a4e64b8495787b6b [2023-11-23 22:35:54,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:35:54,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:35:54,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:35:54,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:35:54,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:35:54,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:54" (1/1) ... [2023-11-23 22:35:54,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9ef29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:54, skipping insertion in model container [2023-11-23 22:35:54,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:54" (1/1) ... [2023-11-23 22:35:54,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:35:55,202 WARN L240 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_46ec47e8-4c50-4251-8cc1-2325d66ec826/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2023-11-23 22:35:55,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:35:55,298 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:35:55,321 WARN L240 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_46ec47e8-4c50-4251-8cc1-2325d66ec826/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2023-11-23 22:35:55,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:35:55,379 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:35:55,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55 WrapperNode [2023-11-23 22:35:55,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:35:55,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:35:55,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:35:55,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:35:55,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,434 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 190 [2023-11-23 22:35:55,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:35:55,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:35:55,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:35:55,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:35:55,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,453 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,467 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:35:55,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:35:55,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:35:55,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:35:55,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:35:55,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (1/1) ... [2023-11-23 22:35:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:35:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:35:55,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:35:55,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:35:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:35:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-23 22:35:55,609 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-23 22:35:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-23 22:35:55,610 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-23 22:35:55,610 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-23 22:35:55,610 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-23 22:35:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-23 22:35:55,613 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-23 22:35:55,614 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-23 22:35:55,615 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-23 22:35:55,615 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-23 22:35:55,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-23 22:35:55,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:35:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-23 22:35:55,616 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-23 22:35:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:35:55,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:35:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-23 22:35:55,617 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-23 22:35:55,770 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:35:55,774 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:35:56,212 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:35:56,261 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:35:56,262 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 22:35:56,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:56 BoogieIcfgContainer [2023-11-23 22:35:56,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:35:56,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:35:56,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:35:56,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:35:56,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:54" (1/3) ... [2023-11-23 22:35:56,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d991eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:56, skipping insertion in model container [2023-11-23 22:35:56,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:55" (2/3) ... [2023-11-23 22:35:56,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d991eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:56, skipping insertion in model container [2023-11-23 22:35:56,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:56" (3/3) ... [2023-11-23 22:35:56,276 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2023-11-23 22:35:56,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:35:56,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:35:56,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:35:56,373 INFO L357 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, mHoare=true, 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;@7b92ad44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:35:56,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:35:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 72 states have internal predecessors, (108), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 22:35:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:35:56,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:56,392 INFO L195 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] [2023-11-23 22:35:56,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:56,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1096187651, now seen corresponding path program 1 times [2023-11-23 22:35:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:56,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944373440] [2023-11-23 22:35:56,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:35:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:35:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:35:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:35:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944373440] [2023-11-23 22:35:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944373440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:35:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656328967] [2023-11-23 22:35:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:56,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:35:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:35:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:35:56,982 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 72 states have internal predecessors, (108), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:35:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:57,527 INFO L93 Difference]: Finished difference Result 195 states and 295 transitions. [2023-11-23 22:35:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:35:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-11-23 22:35:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:57,545 INFO L225 Difference]: With dead ends: 195 [2023-11-23 22:35:57,546 INFO L226 Difference]: Without dead ends: 106 [2023-11-23 22:35:57,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:35:57,558 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 197 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:57,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 197 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:35:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-23 22:35:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2023-11-23 22:35:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 22:35:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-11-23 22:35:57,636 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 52 [2023-11-23 22:35:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:57,637 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-11-23 22:35:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:35:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-11-23 22:35:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:35:57,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:57,641 INFO L195 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] [2023-11-23 22:35:57,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:35:57,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:57,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 202701313, now seen corresponding path program 1 times [2023-11-23 22:35:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:57,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564422173] [2023-11-23 22:35:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:35:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:35:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:35:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:35:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564422173] [2023-11-23 22:35:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564422173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:35:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075654939] [2023-11-23 22:35:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:58,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:35:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:35:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:35:58,101 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:35:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:58,874 INFO L93 Difference]: Finished difference Result 297 states and 422 transitions. [2023-11-23 22:35:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:35:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-11-23 22:35:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:58,886 INFO L225 Difference]: With dead ends: 297 [2023-11-23 22:35:58,887 INFO L226 Difference]: Without dead ends: 215 [2023-11-23 22:35:58,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:35:58,896 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 379 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:58,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 256 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:35:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-23 22:35:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 177. [2023-11-23 22:35:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 139 states have internal predecessors, (192), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-11-23 22:35:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 246 transitions. [2023-11-23 22:35:58,990 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 246 transitions. Word has length 52 [2023-11-23 22:35:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:58,991 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 246 transitions. [2023-11-23 22:35:58,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:35:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 246 transitions. [2023-11-23 22:35:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:35:58,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:58,994 INFO L195 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] [2023-11-23 22:35:58,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:35:58,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:58,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1528816928, now seen corresponding path program 1 times [2023-11-23 22:35:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845977517] [2023-11-23 22:35:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:35:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:35:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:35:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:35:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:35:59,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845977517] [2023-11-23 22:35:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845977517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:59,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:59,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:35:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872197967] [2023-11-23 22:35:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:59,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:35:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:35:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:35:59,386 INFO L87 Difference]: Start difference. First operand 177 states and 246 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:36:00,317 INFO L93 Difference]: Finished difference Result 499 states and 697 transitions. [2023-11-23 22:36:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 22:36:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-11-23 22:36:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:36:00,323 INFO L225 Difference]: With dead ends: 499 [2023-11-23 22:36:00,323 INFO L226 Difference]: Without dead ends: 336 [2023-11-23 22:36:00,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-23 22:36:00,327 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 412 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 22:36:00,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 501 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 22:36:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-23 22:36:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 265. [2023-11-23 22:36:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.4207920792079207) internal successors, (287), 209 states have internal predecessors, (287), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2023-11-23 22:36:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 371 transitions. [2023-11-23 22:36:00,388 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 371 transitions. Word has length 52 [2023-11-23 22:36:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:36:00,388 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 371 transitions. [2023-11-23 22:36:00,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 371 transitions. [2023-11-23 22:36:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:36:00,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:36:00,393 INFO L195 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] [2023-11-23 22:36:00,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:36:00,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:36:00,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:36:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1952463650, now seen corresponding path program 1 times [2023-11-23 22:36:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:36:00,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171959196] [2023-11-23 22:36:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:36:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:36:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:36:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:36:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:36:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:36:00,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:36:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171959196] [2023-11-23 22:36:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171959196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:36:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:36:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:36:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156410079] [2023-11-23 22:36:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:36:00,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:36:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:36:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:36:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:36:00,593 INFO L87 Difference]: Start difference. First operand 265 states and 371 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:36:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:36:01,259 INFO L93 Difference]: Finished difference Result 542 states and 761 transitions. [2023-11-23 22:36:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:36:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-11-23 22:36:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:36:01,271 INFO L225 Difference]: With dead ends: 542 [2023-11-23 22:36:01,271 INFO L226 Difference]: Without dead ends: 297 [2023-11-23 22:36:01,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-23 22:36:01,285 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 109 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:36:01,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 427 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:36:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-23 22:36:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 269. [2023-11-23 22:36:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 212 states have internal predecessors, (288), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-23 22:36:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 373 transitions. [2023-11-23 22:36:01,358 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 373 transitions. Word has length 52 [2023-11-23 22:36:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:36:01,358 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 373 transitions. [2023-11-23 22:36:01,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:36:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 373 transitions. [2023-11-23 22:36:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:36:01,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:36:01,362 INFO L195 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] [2023-11-23 22:36:01,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:36:01,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:36:01,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:36:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -956300252, now seen corresponding path program 1 times [2023-11-23 22:36:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:36:01,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170719221] [2023-11-23 22:36:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:36:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:36:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:36:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:36:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:36:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:36:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:36:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170719221] [2023-11-23 22:36:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170719221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:36:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:36:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:36:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30663519] [2023-11-23 22:36:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:36:01,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:36:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:36:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:36:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:36:01,552 INFO L87 Difference]: Start difference. First operand 269 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:36:02,266 INFO L93 Difference]: Finished difference Result 807 states and 1108 transitions. [2023-11-23 22:36:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:36:02,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-11-23 22:36:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:36:02,273 INFO L225 Difference]: With dead ends: 807 [2023-11-23 22:36:02,273 INFO L226 Difference]: Without dead ends: 558 [2023-11-23 22:36:02,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-23 22:36:02,278 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 385 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:36:02,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 411 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:36:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-11-23 22:36:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 486. [2023-11-23 22:36:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 383 states have internal predecessors, (511), 61 states have call successors, (61), 43 states have call predecessors, (61), 52 states have return successors, (81), 62 states have call predecessors, (81), 58 states have call successors, (81) [2023-11-23 22:36:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2023-11-23 22:36:02,365 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 52 [2023-11-23 22:36:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:36:02,366 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2023-11-23 22:36:02,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2023-11-23 22:36:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:36:02,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:36:02,368 INFO L195 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] [2023-11-23 22:36:02,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:36:02,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:36:02,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:36:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -317515773, now seen corresponding path program 1 times [2023-11-23 22:36:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:36:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729701782] [2023-11-23 22:36:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:36:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:36:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:36:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:36:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:36:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:36:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:36:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729701782] [2023-11-23 22:36:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729701782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:36:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:36:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:36:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049275810] [2023-11-23 22:36:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:36:02,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:36:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:36:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:36:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:36:02,564 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:36:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:36:03,042 INFO L93 Difference]: Finished difference Result 1016 states and 1365 transitions. [2023-11-23 22:36:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:36:03,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-11-23 22:36:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:36:03,052 INFO L225 Difference]: With dead ends: 1016 [2023-11-23 22:36:03,052 INFO L226 Difference]: Without dead ends: 550 [2023-11-23 22:36:03,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:36:03,055 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:36:03,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 426 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:36:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-11-23 22:36:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 498. [2023-11-23 22:36:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 381 states have (on average 1.356955380577428) internal successors, (517), 392 states have internal predecessors, (517), 61 states have call successors, (61), 43 states have call predecessors, (61), 55 states have return successors, (84), 65 states have call predecessors, (84), 58 states have call successors, (84) [2023-11-23 22:36:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 662 transitions. [2023-11-23 22:36:03,117 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 662 transitions. Word has length 52 [2023-11-23 22:36:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:36:03,118 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 662 transitions. [2023-11-23 22:36:03,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:36:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 662 transitions. [2023-11-23 22:36:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:36:03,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:36:03,120 INFO L195 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] [2023-11-23 22:36:03,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:36:03,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:36:03,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:36:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 105186053, now seen corresponding path program 1 times [2023-11-23 22:36:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:36:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221087685] [2023-11-23 22:36:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:36:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:36:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:36:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:36:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:36:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:36:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:36:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:36:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:36:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:36:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221087685] [2023-11-23 22:36:03,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221087685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:36:03,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:36:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:36:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764434159] [2023-11-23 22:36:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:36:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:36:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:36:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:36:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:36:03,348 INFO L87 Difference]: Start difference. First operand 498 states and 662 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:36:04,014 INFO L93 Difference]: Finished difference Result 1074 states and 1391 transitions. [2023-11-23 22:36:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 22:36:04,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-11-23 22:36:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:36:04,019 INFO L225 Difference]: With dead ends: 1074 [2023-11-23 22:36:04,020 INFO L226 Difference]: Without dead ends: 666 [2023-11-23 22:36:04,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-23 22:36:04,022 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 372 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:36:04,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 297 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:36:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-23 22:36:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 506. [2023-11-23 22:36:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 388 states have (on average 1.347938144329897) internal successors, (523), 398 states have internal predecessors, (523), 62 states have call successors, (62), 44 states have call predecessors, (62), 55 states have return successors, (81), 66 states have call predecessors, (81), 59 states have call successors, (81) [2023-11-23 22:36:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 666 transitions. [2023-11-23 22:36:04,081 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 666 transitions. Word has length 52 [2023-11-23 22:36:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:36:04,081 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 666 transitions. [2023-11-23 22:36:04,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:36:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 666 transitions. [2023-11-23 22:36:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:36:04,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:36:04,083 INFO L195 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] [2023-11-23 22:36:04,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:36:04,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:36:04,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:36:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash -915882301, now seen corresponding path program 1 times [2023-11-23 22:36:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:36:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176816759] [2023-11-23 22:36:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:36:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:36:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:36:04,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:36:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:36:04,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:36:04,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:36:04,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:36:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:36:04,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:36:04,147 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:36:04,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-23 22:36:04,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-23 22:36:04,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-23 22:36:04,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:36:04 BoogieIcfgContainer [2023-11-23 22:36:04,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:36:04,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:36:04,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:36:04,230 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:36:04,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:56" (3/4) ... [2023-11-23 22:36:04,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 22:36:04,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-23 22:36:04,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-23 22:36:04,250 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-23 22:36:04,328 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 22:36:04,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:36:04,329 INFO L158 Benchmark]: Toolchain (without parser) took 9422.38ms. Allocated memory was 138.4MB in the beginning and 232.8MB in the end (delta: 94.4MB). Free memory was 92.3MB in the beginning and 118.1MB in the end (delta: -25.8MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,329 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 126.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:36:04,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.04ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 79.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 77.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,330 INFO L158 Benchmark]: Boogie Preprocessor took 64.76ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 74.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,331 INFO L158 Benchmark]: RCFGBuilder took 755.23ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 158.3MB in the end (delta: -83.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,332 INFO L158 Benchmark]: TraceAbstraction took 7962.26ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 157.4MB in the beginning and 124.4MB in the end (delta: 33.0MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,332 INFO L158 Benchmark]: Witness Printer took 98.98ms. Allocated memory is still 232.8MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 22:36:04,335 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 126.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.04ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 79.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 77.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.76ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 74.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.23ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 158.3MB in the end (delta: -83.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7962.26ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 157.4MB in the beginning and 124.4MB in the end (delta: 33.0MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 98.98ms. Allocated memory is still 232.8MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] c_dr_i = 1 [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] CALL update_channels() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L222] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] COND TRUE (int )c_dr_i == 1 [L243] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] RET init_threads() [L414] CALL fire_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L275] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L280] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL activate_threads() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L308] int tmp ; [L309] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L62] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L75] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L77] return (__retres1); [L313] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] tmp = is_do_write_p_triggered() [L315] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L81] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L94] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L96] return (__retres1); [L321] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] tmp___0 = is_do_read_c_triggered() [L323] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] CALL reset_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L293] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L419] COND TRUE 1 [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L252] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L255] COND TRUE (int )p_dw_st == 0 [L256] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L268] return (__retres1); [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] tmp___1 = exists_runnable_thread() [L344] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L359] CALL error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L20] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2010 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1965 mSDsluCounter, 2515 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1910 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3089 IncrementalHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 605 mSDtfsCounter, 3089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 438 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 22:36:04,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ec47e8-4c50-4251-8cc1-2325d66ec826/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE