./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:05:08,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:05:09,000 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:05:09,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:05:09,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:05:09,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:05:09,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:05:09,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:05:09,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:05:09,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:05:09,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:05:09,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:05:09,064 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:05:09,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:05:09,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:05:09,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:05:09,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:05:09,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:05:09,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:05:09,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:05:09,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:05:09,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:05:09,070 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:05:09,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:05:09,070 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:05:09,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:05:09,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:05:09,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:05:09,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:09,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:05:09,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:05:09,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:05:09,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:05:09,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:05:09,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:05:09,076 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:05:09,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:05:09,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:05:09,077 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:05:09,077 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_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/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_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2023-11-06 23:05:09,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:05:09,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:05:09,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:05:09,412 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:05:09,413 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:05:09,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-11-06 23:05:12,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:05:12,828 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:05:12,828 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-11-06 23:05:12,855 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/data/be9e943dd/8840e90837e34a9e8ca4053066dfc6cf/FLAG28c385411 [2023-11-06 23:05:12,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/data/be9e943dd/8840e90837e34a9e8ca4053066dfc6cf [2023-11-06 23:05:12,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:05:12,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:05:12,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:12,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:05:12,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:05:12,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8684d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12, skipping insertion in model container [2023-11-06 23:05:12,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:05:13,178 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_af3bf196-fada-4535-bc1a-720fd2271400/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2023-11-06 23:05:13,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:13,301 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:05:13,317 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_af3bf196-fada-4535-bc1a-720fd2271400/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2023-11-06 23:05:13,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:13,377 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:05:13,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13 WrapperNode [2023-11-06 23:05:13,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:13,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:13,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:05:13,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:05:13,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,422 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2023-11-06 23:05:13,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:13,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:05:13,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:05:13,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:05:13,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:05:13,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:05:13,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:05:13,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:05:13,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (1/1) ... [2023-11-06 23:05:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:13,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:05:13,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:05:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:05:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 23:05:13,541 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 23:05:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-06 23:05:13,541 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-06 23:05:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 23:05:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 23:05:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 23:05:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 23:05:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 23:05:13,542 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 23:05:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 23:05:13,544 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 23:05:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:05:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 23:05:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 23:05:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:05:13,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:05:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-06 23:05:13,546 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-06 23:05:13,678 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:05:13,680 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:05:14,070 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2023-11-06 23:05:14,071 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-11-06 23:05:14,096 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:05:14,104 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:05:14,104 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 23:05:14,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:14 BoogieIcfgContainer [2023-11-06 23:05:14,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:05:14,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:05:14,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:05:14,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:05:14,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:05:12" (1/3) ... [2023-11-06 23:05:14,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3e7a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:14, skipping insertion in model container [2023-11-06 23:05:14,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:13" (2/3) ... [2023-11-06 23:05:14,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3e7a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:14, skipping insertion in model container [2023-11-06 23:05:14,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:14" (3/3) ... [2023-11-06 23:05:14,125 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2023-11-06 23:05:14,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:05:14,148 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:05:14,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:05:14,212 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=LoopsAndPotentialCycles, 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;@29f6819, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:05:14,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:05:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:05:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 23:05:14,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:14,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:14,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:14,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2023-11-06 23:05:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022075134] [2023-11-06 23:05:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:05:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 23:05:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:14,943 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-06 23:05:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022075134] [2023-11-06 23:05:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022075134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:05:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461153128] [2023-11-06 23:05:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:15,050 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-06 23:05:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:15,965 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2023-11-06 23:05:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:05:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2023-11-06 23:05:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:15,982 INFO L225 Difference]: With dead ends: 382 [2023-11-06 23:05:15,982 INFO L226 Difference]: Without dead ends: 264 [2023-11-06 23:05:15,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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-06 23:05:15,991 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 379 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:15,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 532 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:05:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-06 23:05:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2023-11-06 23:05:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2023-11-06 23:05:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2023-11-06 23:05:16,077 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2023-11-06 23:05:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:16,078 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2023-11-06 23:05:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-06 23:05:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2023-11-06 23:05:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 23:05:16,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:16,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:05:16,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:16,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2023-11-06 23:05:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799488506] [2023-11-06 23:05:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:05:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 23:05:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,440 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-06 23:05:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799488506] [2023-11-06 23:05:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799488506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:05:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275892111] [2023-11-06 23:05:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:16,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:16,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:16,449 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 23:05:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:17,446 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2023-11-06 23:05:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:05:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2023-11-06 23:05:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:17,452 INFO L225 Difference]: With dead ends: 622 [2023-11-06 23:05:17,453 INFO L226 Difference]: Without dead ends: 413 [2023-11-06 23:05:17,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:05:17,457 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 457 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:17,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 742 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:05:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-11-06 23:05:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2023-11-06 23:05:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2023-11-06 23:05:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2023-11-06 23:05:17,519 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2023-11-06 23:05:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:17,520 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2023-11-06 23:05:17,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-06 23:05:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2023-11-06 23:05:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 23:05:17,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:17,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:17,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:05:17,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:17,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2023-11-06 23:05:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:17,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410257476] [2023-11-06 23:05:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:05:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 23:05:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:17,793 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-06 23:05:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410257476] [2023-11-06 23:05:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410257476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:05:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562899629] [2023-11-06 23:05:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:05:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:05:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:05:17,797 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-06 23:05:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:19,549 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2023-11-06 23:05:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 23:05:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2023-11-06 23:05:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:19,562 INFO L225 Difference]: With dead ends: 1883 [2023-11-06 23:05:19,563 INFO L226 Difference]: Without dead ends: 1550 [2023-11-06 23:05:19,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 23:05:19,569 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 1663 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:19,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1021 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 23:05:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2023-11-06 23:05:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2023-11-06 23:05:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2023-11-06 23:05:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2023-11-06 23:05:19,779 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2023-11-06 23:05:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:19,780 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2023-11-06 23:05:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-06 23:05:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2023-11-06 23:05:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 23:05:19,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:19,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:19,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:05:19,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:19,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2023-11-06 23:05:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927765397] [2023-11-06 23:05:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 23:05:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,020 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-06 23:05:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927765397] [2023-11-06 23:05:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927765397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:05:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489866454] [2023-11-06 23:05:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:20,024 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-06 23:05:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:20,723 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2023-11-06 23:05:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:05:20,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2023-11-06 23:05:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:20,737 INFO L225 Difference]: With dead ends: 2918 [2023-11-06 23:05:20,738 INFO L226 Difference]: Without dead ends: 1538 [2023-11-06 23:05:20,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:05:20,754 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:20,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 620 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:05:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2023-11-06 23:05:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2023-11-06 23:05:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2023-11-06 23:05:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2023-11-06 23:05:20,942 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2023-11-06 23:05:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:20,943 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2023-11-06 23:05:20,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-06 23:05:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2023-11-06 23:05:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 23:05:20,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:20,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:20,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:05:20,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:20,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2023-11-06 23:05:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254058236] [2023-11-06 23:05:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 23:05:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,097 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-06 23:05:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254058236] [2023-11-06 23:05:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254058236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:21,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:05:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921587178] [2023-11-06 23:05:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:21,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:05:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:05:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:05:21,101 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 23:05:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:23,028 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2023-11-06 23:05:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 23:05:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-06 23:05:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:23,042 INFO L225 Difference]: With dead ends: 5002 [2023-11-06 23:05:23,042 INFO L226 Difference]: Without dead ends: 1821 [2023-11-06 23:05:23,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 23:05:23,053 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 1565 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:23,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1203 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 23:05:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2023-11-06 23:05:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2023-11-06 23:05:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2023-11-06 23:05:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2023-11-06 23:05:23,247 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2023-11-06 23:05:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:23,247 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2023-11-06 23:05:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 23:05:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2023-11-06 23:05:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 23:05:23,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:23,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:23,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:05:23,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:23,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2023-11-06 23:05:23,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:23,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943027966] [2023-11-06 23:05:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 23:05:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:05:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943027966] [2023-11-06 23:05:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943027966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:23,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:05:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292208207] [2023-11-06 23:05:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:23,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:23,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:23,408 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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-06 23:05:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:24,080 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2023-11-06 23:05:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:05:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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 90 [2023-11-06 23:05:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:24,094 INFO L225 Difference]: With dead ends: 3466 [2023-11-06 23:05:24,094 INFO L226 Difference]: Without dead ends: 1835 [2023-11-06 23:05:24,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:05:24,100 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 192 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 510 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:05:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2023-11-06 23:05:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2023-11-06 23:05:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2023-11-06 23:05:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2023-11-06 23:05:24,301 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2023-11-06 23:05:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:24,305 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2023-11-06 23:05:24,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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-06 23:05:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2023-11-06 23:05:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 23:05:24,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:24,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:24,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:05:24,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:24,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2023-11-06 23:05:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:24,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992950001] [2023-11-06 23:05:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 23:05:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:05:24,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992950001] [2023-11-06 23:05:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992950001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:24,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:24,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:05:24,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318234014] [2023-11-06 23:05:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:24,572 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-06 23:05:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:25,546 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2023-11-06 23:05:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:05:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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 90 [2023-11-06 23:05:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:25,560 INFO L225 Difference]: With dead ends: 3228 [2023-11-06 23:05:25,560 INFO L226 Difference]: Without dead ends: 1775 [2023-11-06 23:05:25,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:05:25,565 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:25,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 561 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:05:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2023-11-06 23:05:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2023-11-06 23:05:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2023-11-06 23:05:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2023-11-06 23:05:25,775 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2023-11-06 23:05:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:25,776 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2023-11-06 23:05:25,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-06 23:05:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2023-11-06 23:05:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 23:05:25,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:25,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:05:25,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:25,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2023-11-06 23:05:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689137421] [2023-11-06 23:05:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 23:05:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:05:25,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689137421] [2023-11-06 23:05:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689137421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:25,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:25,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:05:25,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012624512] [2023-11-06 23:05:25,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:25,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:05:25,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:05:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:05:25,936 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:05:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:26,698 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2023-11-06 23:05:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:05:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2023-11-06 23:05:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:26,723 INFO L225 Difference]: With dead ends: 4632 [2023-11-06 23:05:26,723 INFO L226 Difference]: Without dead ends: 3163 [2023-11-06 23:05:26,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:05:26,729 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 371 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:26,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 417 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:05:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2023-11-06 23:05:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2023-11-06 23:05:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2023-11-06 23:05:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2023-11-06 23:05:27,127 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2023-11-06 23:05:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:27,127 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2023-11-06 23:05:27,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:05:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2023-11-06 23:05:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 23:05:27,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:27,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:27,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:05:27,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:27,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2023-11-06 23:05:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851364262] [2023-11-06 23:05:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 23:05:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:05:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851364262] [2023-11-06 23:05:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851364262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:27,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:05:27,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478544327] [2023-11-06 23:05:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:27,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:05:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:05:27,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:05:27,217 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-06 23:05:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:27,675 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2023-11-06 23:05:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:05:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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 90 [2023-11-06 23:05:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:27,688 INFO L225 Difference]: With dead ends: 4533 [2023-11-06 23:05:27,688 INFO L226 Difference]: Without dead ends: 1595 [2023-11-06 23:05:27,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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-06 23:05:27,698 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 294 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:27,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 195 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:05:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2023-11-06 23:05:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2023-11-06 23:05:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2023-11-06 23:05:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2023-11-06 23:05:27,948 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2023-11-06 23:05:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:27,948 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2023-11-06 23:05:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-06 23:05:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2023-11-06 23:05:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 23:05:27,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:27,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:05:27,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:27,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2023-11-06 23:05:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465549350] [2023-11-06 23:05:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:05:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465549350] [2023-11-06 23:05:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465549350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:05:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732018853] [2023-11-06 23:05:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:28,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:28,120 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 23:05:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:29,514 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2023-11-06 23:05:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 23:05:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2023-11-06 23:05:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:29,530 INFO L225 Difference]: With dead ends: 3898 [2023-11-06 23:05:29,531 INFO L226 Difference]: Without dead ends: 2278 [2023-11-06 23:05:29,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2023-11-06 23:05:29,537 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:29,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 507 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:05:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2023-11-06 23:05:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2023-11-06 23:05:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2023-11-06 23:05:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2023-11-06 23:05:29,827 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2023-11-06 23:05:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:29,827 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2023-11-06 23:05:29,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 23:05:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2023-11-06 23:05:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 23:05:29,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:29,831 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:29,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:05:29,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:29,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2023-11-06 23:05:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760072071] [2023-11-06 23:05:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 23:05:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:05:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 23:05:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:05:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 23:05:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 23:05:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-06 23:05:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 23:05:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760072071] [2023-11-06 23:05:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760072071] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649184517] [2023-11-06 23:05:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:30,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:30,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:05:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:30,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:05:30,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 23:05:30,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649184517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:30,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:05:30,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 23:05:30,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470114817] [2023-11-06 23:05:30,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:30,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:30,407 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:05:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:30,824 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2023-11-06 23:05:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2023-11-06 23:05:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:30,849 INFO L225 Difference]: With dead ends: 6027 [2023-11-06 23:05:30,849 INFO L226 Difference]: Without dead ends: 4013 [2023-11-06 23:05:30,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:30,856 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:30,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 272 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2023-11-06 23:05:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2023-11-06 23:05:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2023-11-06 23:05:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2023-11-06 23:05:31,471 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2023-11-06 23:05:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:31,473 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2023-11-06 23:05:31,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:05:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2023-11-06 23:05:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 23:05:31,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:31,478 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:31,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 23:05:31,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:31,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:31,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2023-11-06 23:05:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8311141] [2023-11-06 23:05:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 23:05:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:05:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 23:05:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 23:05:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 23:05:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 23:05:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 23:05:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-06 23:05:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-06 23:05:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-06 23:05:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8311141] [2023-11-06 23:05:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8311141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454129843] [2023-11-06 23:05:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:31,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:31,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:31,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:05:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:32,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:05:32,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-06 23:05:32,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454129843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:05:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 23:05:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117230963] [2023-11-06 23:05:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:32,301 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 23:05:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:33,175 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2023-11-06 23:05:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2023-11-06 23:05:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:33,226 INFO L225 Difference]: With dead ends: 11891 [2023-11-06 23:05:33,226 INFO L226 Difference]: Without dead ends: 7931 [2023-11-06 23:05:33,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:33,237 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:33,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2023-11-06 23:05:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2023-11-06 23:05:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2023-11-06 23:05:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2023-11-06 23:05:34,211 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2023-11-06 23:05:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:34,212 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2023-11-06 23:05:34,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 23:05:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2023-11-06 23:05:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 23:05:34,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:34,222 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:34,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:34,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 23:05:34,429 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:34,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2023-11-06 23:05:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760702803] [2023-11-06 23:05:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:05:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:05:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:05:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:05:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 23:05:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:05:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 23:05:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 23:05:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 23:05:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 23:05:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 23:05:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:05:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:05:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-06 23:05:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-06 23:05:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-06 23:05:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760702803] [2023-11-06 23:05:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760702803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85115266] [2023-11-06 23:05:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:34,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:34,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:05:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:05:34,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-06 23:05:35,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85115266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:35,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:05:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 23:05:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794046196] [2023-11-06 23:05:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:35,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:35,147 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 23:05:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:36,032 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2023-11-06 23:05:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2023-11-06 23:05:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:36,037 INFO L225 Difference]: With dead ends: 14427 [2023-11-06 23:05:36,038 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:05:36,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:36,116 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:05:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:05:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:05:36,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2023-11-06 23:05:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:36,120 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:05:36,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 23:05:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:05:36,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:05:36,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:05:36,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 23:05:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:36,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:06:25,561 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (and (or (not (= |old(~c_dr_st~0)| 0)) (and .cse0 (= ~c_dr_st~0 0)) (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))) (or (and .cse0 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= ~c_dr_pc~0 1))))) [2023-11-06 23:06:25,561 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse4 (= ~p_dw_st~0 0))) (let ((.cse6 (not .cse4)) (.cse7 (= |old(~p_dw_st~0)| 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse0 (not (= |old(~c_dr_st~0)| 0))) (.cse10 (= activate_threads_~tmp~1 0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse3 (< 0 ~c_dr_pc~0)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse2 (= ~c_dr_st~0 0))) (or .cse0 (and .cse1 .cse2) .cse3 (and .cse2 .cse4) .cse5)) (or .cse6 .cse0 .cse7 .cse8 .cse9 .cse3 .cse5) (or (< ~fast_clk_edge~0 2) .cse6 .cse0 .cse7 (not .cse8) .cse3 .cse5) (or (and .cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse10) .cse8 (not (= ~c_dr_pc~0 1)) .cse9) (or .cse0 .cse10 .cse8 .cse9 .cse3 .cse5)))) [2023-11-06 23:06:25,562 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2023-11-06 23:06:25,562 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-11-06 23:06:25,562 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2023-11-06 23:06:25,562 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (and (or (not (= |old(~c_dr_st~0)| 0)) (and .cse0 (= ~c_dr_st~0 0)) (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))) (or (and .cse0 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= ~c_dr_pc~0 1))))) [2023-11-06 23:06:25,562 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2023-11-06 23:06:25,562 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2023-11-06 23:06:25,563 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-11-06 23:06:25,563 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2023-11-06 23:06:25,563 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2023-11-06 23:06:25,563 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2023-11-06 23:06:25,563 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2023-11-06 23:06:25,563 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2023-11-06 23:06:25,564 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2023-11-06 23:06:25,564 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2023-11-06 23:06:25,564 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2023-11-06 23:06:25,564 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2023-11-06 23:06:25,564 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (= is_do_read_c_triggered_~__retres1~1 0) (not (= ~c_dr_st~0 0)) (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))) [2023-11-06 23:06:25,564 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2023-11-06 23:06:25,565 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2023-11-06 23:06:25,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2023-11-06 23:06:25,565 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2023-11-06 23:06:25,565 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2023-11-06 23:06:25,565 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2023-11-06 23:06:25,566 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (= ~c_dr_st~0 0)) .cse0 (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))))) [2023-11-06 23:06:25,566 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2023-11-06 23:06:25,566 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2023-11-06 23:06:25,566 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2023-11-06 23:06:25,566 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 32 51) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 0)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse0 (not (= ~c_dr_st~0 0))) (.cse5 (not (= |old(~q_req_up~0)| 0))) (.cse2 (< 0 ~c_dr_pc~0)) (.cse3 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4) (or .cse4 .cse5) (or .cse0 .cse5 .cse2 .cse3))) [2023-11-06 23:06:25,566 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2023-11-06 23:06:25,567 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or .cse0 (not (= ~c_dr_st~0 0)) (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))))) [2023-11-06 23:06:25,567 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2023-11-06 23:06:25,567 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-06 23:06:25,567 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2023-11-06 23:06:25,567 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2023-11-06 23:06:25,567 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2023-11-06 23:06:25,568 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (= ~c_dr_st~0 0)) .cse0 (< 0 ~c_dr_pc~0) (not (= 1 ~c_dr_i~0))))) [2023-11-06 23:06:25,568 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2023-11-06 23:06:25,568 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2023-11-06 23:06:25,568 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-06 23:06:25,568 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2023-11-06 23:06:25,568 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2023-11-06 23:06:25,569 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,569 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2023-11-06 23:06:25,569 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2023-11-06 23:06:25,569 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2023-11-06 23:06:25,569 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2023-11-06 23:06:25,569 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,570 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 476 534) the Hoare annotation is: true [2023-11-06 23:06:25,570 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,570 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2023-11-06 23:06:25,570 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2023-11-06 23:06:25,570 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2023-11-06 23:06:25,571 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (<= 2 ~fast_clk_edge~0)) [2023-11-06 23:06:25,571 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2023-11-06 23:06:25,571 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,571 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 179) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,571 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2023-11-06 23:06:25,571 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,572 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_write_ev~0 2)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~slow_clk_edge~0) .cse5 .cse6 (<= 2 ~fast_clk_edge~0)))) [2023-11-06 23:06:25,572 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_write_ev~0 2)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~slow_clk_edge~0) .cse5 .cse6 (<= 2 ~fast_clk_edge~0)))) [2023-11-06 23:06:25,572 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2023-11-06 23:06:25,572 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 198 252) the Hoare annotation is: false [2023-11-06 23:06:25,572 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,573 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,573 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2023-11-06 23:06:25,573 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_write_ev~0 2)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~slow_clk_edge~0) .cse5 .cse6 (<= 2 ~fast_clk_edge~0)))) [2023-11-06 23:06:25,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:06:25,573 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,574 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-11-06 23:06:25,574 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2023-11-06 23:06:25,574 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 535 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (<= 2 ~fast_clk_edge~0)) [2023-11-06 23:06:25,574 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,574 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,574 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2023-11-06 23:06:25,575 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-11-06 23:06:25,575 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 554 565) the Hoare annotation is: true [2023-11-06 23:06:25,575 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2023-11-06 23:06:25,575 INFO L895 garLoopResultBuilder]: At program point $Ultimate##36(lines 171 179) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2023-11-06 23:06:25,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:06:25,575 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,576 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2023-11-06 23:06:25,576 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2023-11-06 23:06:25,576 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2023-11-06 23:06:25,576 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-06 23:06:25,576 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: true [2023-11-06 23:06:25,576 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2023-11-06 23:06:25,576 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:06:25,577 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_write_ev~0 2)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~slow_clk_edge~0) .cse5 .cse6 (<= 2 ~fast_clk_edge~0)))) [2023-11-06 23:06:25,577 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,577 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2023-11-06 23:06:25,577 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2023-11-06 23:06:25,577 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,578 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse3 (= ~q_req_up~0 1)) (.cse0 (= ~c_dr_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse4 (not (= ~p_dw_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse1 (not (= ~p_dw_pc~0 1))) (.cse6 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse0) (and .cse2 .cse4 .cse5 .cse1 .cse6))) [2023-11-06 23:06:25,578 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:06:25,578 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2023-11-06 23:06:25,578 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2023-11-06 23:06:25,578 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2023-11-06 23:06:25,579 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,579 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2023-11-06 23:06:25,579 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-11-06 23:06:25,579 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,579 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-11-06 23:06:25,579 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2023-11-06 23:06:25,579 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2023-11-06 23:06:25,580 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2023-11-06 23:06:25,580 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse0 (= ~p_dw_pc~0 1)) (.cse1 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse4 (< 0 ~c_dr_pc~0)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1)) .cse1 .cse2) (or (< ~fast_clk_edge~0 2) .cse3 (not .cse0) .cse1 .cse4 .cse5) (or .cse3 .cse0 .cse1 .cse2 .cse4 .cse5))) [2023-11-06 23:06:25,580 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2023-11-06 23:06:25,580 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2023-11-06 23:06:25,580 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2023-11-06 23:06:25,580 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2023-11-06 23:06:25,581 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2023-11-06 23:06:25,581 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-11-06 23:06:25,581 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2023-11-06 23:06:25,581 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-11-06 23:06:25,581 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-11-06 23:06:25,581 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 23:06:25,582 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2023-11-06 23:06:25,585 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:25,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:06:25,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:06:25 BoogieIcfgContainer [2023-11-06 23:06:25,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:06:25,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:06:25,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:06:25,613 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:06:25,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:14" (3/4) ... [2023-11-06 23:06:25,616 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-06 23:06:25,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-06 23:06:25,622 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-06 23:06:25,622 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-06 23:06:25,632 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-06 23:06:25,633 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:06:25,633 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:06:25,634 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:06:25,664 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((c_dr_st == 0)) || (q_req_up == 0)) || (0 < c_dr_pc)) || !((1 == c_dr_i))) && ((q_req_up == 0) || !((c_dr_pc == 1)))) && (!((c_dr_pc == 1)) || !((\old(q_req_up) == 0)))) && (((!((c_dr_st == 0)) || !((\old(q_req_up) == 0))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) [2023-11-06 23:06:25,706 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((c_dr_st == 0)) || (q_req_up == 0)) || (0 < c_dr_pc)) || !((1 == c_dr_i))) && ((q_req_up == 0) || !((c_dr_pc == 1)))) && (!((c_dr_pc == 1)) || !((\old(q_req_up) == 0)))) && (((!((c_dr_st == 0)) || !((\old(q_req_up) == 0))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) [2023-11-06 23:06:25,736 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:06:25,737 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:06:25,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:06:25,738 INFO L158 Benchmark]: Toolchain (without parser) took 72863.28ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 138.3MB in the beginning and 1.1GB in the end (delta: -934.5MB). Peak memory consumption was 797.0MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,738 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 165.7MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:06:25,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.46ms. Allocated memory is still 165.7MB. Free memory was 138.3MB in the beginning and 124.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 122.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,739 INFO L158 Benchmark]: Boogie Preprocessor took 32.09ms. Allocated memory is still 165.7MB. Free memory was 122.3MB in the beginning and 120.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,740 INFO L158 Benchmark]: RCFGBuilder took 651.14ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 100.1MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,740 INFO L158 Benchmark]: TraceAbstraction took 71493.14ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 99.8MB in the beginning and 1.1GB in the end (delta: -982.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-06 23:06:25,740 INFO L158 Benchmark]: Witness Printer took 124.58ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:06:25,742 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.32ms. Allocated memory is still 165.7MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.46ms. Allocated memory is still 165.7MB. Free memory was 138.3MB in the beginning and 124.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 122.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.09ms. Allocated memory is still 165.7MB. Free memory was 122.3MB in the beginning and 120.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 651.14ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 100.1MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 71493.14ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 99.8MB in the beginning and 1.1GB in the end (delta: -982.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 124.58ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.4s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7006 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6901 mSDsluCounter, 6980 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5281 mSDsCounter, 1733 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6561 IncrementalHoareTripleChecker+Invalid, 8294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1733 mSolverCounterUnsat, 1699 mSDtfsCounter, 6561 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10366 NumberOfFragments, 1037 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 4563515 FormulaSimplificationTreeSizeReduction, 32.6s HoareSimplificationTime, 46 FomulaSimplificationsInter, 126381 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (c_dr_pc == 1) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 0) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (p_dw_pc == 1)) && (c_dr_pc <= 0)) || ((c_dr_pc == 1) && (p_dw_pc == 1))) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 1) || !((c_dr_pc == 1))) || (__retres1 == 0)) || !((q_read_ev == 2))) && ((((((fast_clk_edge < 2) || !((c_dr_st == 0))) || !((p_dw_pc == 1))) || (__retres1 == 0)) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) && (((((!((c_dr_st == 0)) || (p_dw_pc == 1)) || (__retres1 == 0)) || !((q_read_ev == 2))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((c_dr_st == 0) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((__retres1 == 0) || !((c_dr_st == 0))) || (0 < c_dr_pc)) || !((1 == c_dr_i))) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((c_dr_pc == 1) && !((p_dw_pc == 1))) || (((((c_dr_st == 0) && (q_req_up == 1)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (c_dr_pc <= 0))) || ((q_req_up == 1) && (c_dr_pc == 1))) || (((((c_dr_st == 0) && !((p_dw_st == 0))) && (1 == c_dr_i)) && !((p_dw_pc == 1))) && (c_dr_pc <= 0))) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (c_dr_st == 0)) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (q_write_ev == 2)) && (2 <= slow_clk_edge)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 <= fast_clk_edge))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((c_dr_st == 0) && !((p_dw_st == 0))) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((!((c_dr_st == 0)) || (q_req_up == 0)) || (0 < c_dr_pc)) || !((1 == c_dr_i))) && ((q_req_up == 0) || !((c_dr_pc == 1)))) && (!((c_dr_pc == 1)) || !((\old(q_req_up) == 0)))) && (((!((c_dr_st == 0)) || !((\old(q_req_up) == 0))) || (0 < c_dr_pc)) || !((1 == c_dr_i)))) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:06:25,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af3bf196-fada-4535-bc1a-720fd2271400/bin/uautomizer-verify-WvqO1wxjHP/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 Result: TRUE