./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:35:41,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:35:41,833 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:35:41,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:35:41,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:35:41,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:35:41,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:35:41,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:35:41,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:35:41,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:35:41,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:35:41,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:35:41,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:35:41,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:35:41,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:35:41,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:35:41,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:35:41,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:35:41,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:35:41,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:35:41,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:35:41,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:35:41,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:35:41,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:35:41,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:35:41,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:35:41,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:35:41,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:35:41,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:35:41,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:35:41,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:35:41,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:35:41,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:35:41,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:35:41,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:35:41,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:35:41,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:35:41,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:35:41,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:35:41,877 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:35:41,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:35:41,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:35:41,878 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_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/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_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2023-11-29 06:35:42,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:35:42,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:35:42,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:35:42,109 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:35:42,110 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:35:42,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2023-11-29 06:35:44,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:35:45,027 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:35:45,028 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2023-11-29 06:35:45,037 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/data/123026a99/34b4860492fe41299f28b34467191340/FLAG483ff5488 [2023-11-29 06:35:45,051 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/data/123026a99/34b4860492fe41299f28b34467191340 [2023-11-29 06:35:45,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:35:45,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:35:45,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:35:45,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:35:45,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:35:45,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7173e667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45, skipping insertion in model container [2023-11-29 06:35:45,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:35:45,209 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_87b0f24b-58c9-4151-ade4-ff8bd66504da/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-11-29 06:35:45,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:35:45,263 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:35:45,276 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_87b0f24b-58c9-4151-ade4-ff8bd66504da/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-11-29 06:35:45,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:35:45,313 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:35:45,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45 WrapperNode [2023-11-29 06:35:45,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:35:45,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:35:45,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:35:45,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:35:45,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,356 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 189 [2023-11-29 06:35:45,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:35:45,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:35:45,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:35:45,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:35:45,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,385 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 06:35:45,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:35:45,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:35:45,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:35:45,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:35:45,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (1/1) ... [2023-11-29 06:35:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:35:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:35:45,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:35:45,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:35:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:35:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-29 06:35:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-29 06:35:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 06:35:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 06:35:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 06:35:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 06:35:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 06:35:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 06:35:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 06:35:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 06:35:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 06:35:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 06:35:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:35:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 06:35:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 06:35:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:35:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:35:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 06:35:45,469 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 06:35:45,546 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:35:45,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:35:45,829 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:35:45,869 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:35:45,869 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 06:35:45,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:35:45 BoogieIcfgContainer [2023-11-29 06:35:45,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:35:45,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:35:45,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:35:45,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:35:45,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:35:45" (1/3) ... [2023-11-29 06:35:45,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eed04d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:35:45, skipping insertion in model container [2023-11-29 06:35:45,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:35:45" (2/3) ... [2023-11-29 06:35:45,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eed04d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:35:45, skipping insertion in model container [2023-11-29 06:35:45,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:35:45" (3/3) ... [2023-11-29 06:35:45,879 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2023-11-29 06:35:45,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:35:45,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:35:45,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:35:45,947 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7abdf2e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:35:45,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:35:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 06:35:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:35:45,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:45,963 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] [2023-11-29 06:35:45,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:45,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1654461006, now seen corresponding path program 1 times [2023-11-29 06:35:45,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:45,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927045260] [2023-11-29 06:35:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,288 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-29 06:35:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927045260] [2023-11-29 06:35:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927045260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:46,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:35:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848727233] [2023-11-29 06:35:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:46,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:35:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:35:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:35:46,325 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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-29 06:35:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:46,671 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2023-11-29 06:35:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:35:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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 57 [2023-11-29 06:35:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:46,683 INFO L225 Difference]: With dead ends: 193 [2023-11-29 06:35:46,683 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 06:35:46,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:35:46,691 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 236 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:46,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 153 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:35:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 06:35:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-11-29 06:35:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 06:35:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2023-11-29 06:35:46,746 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 57 [2023-11-29 06:35:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:46,747 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2023-11-29 06:35:46,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 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-29 06:35:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2023-11-29 06:35:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:35:46,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:46,750 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] [2023-11-29 06:35:46,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:35:46,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:46,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1173380748, now seen corresponding path program 1 times [2023-11-29 06:35:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901391368] [2023-11-29 06:35:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:46,990 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-29 06:35:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901391368] [2023-11-29 06:35:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901391368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:35:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223076106] [2023-11-29 06:35:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:35:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:35:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:35:46,995 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-29 06:35:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:47,614 INFO L93 Difference]: Finished difference Result 294 states and 419 transitions. [2023-11-29 06:35:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:35:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-11-29 06:35:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:47,630 INFO L225 Difference]: With dead ends: 294 [2023-11-29 06:35:47,630 INFO L226 Difference]: Without dead ends: 213 [2023-11-29 06:35:47,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:35:47,633 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 363 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:47,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 254 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:35:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-29 06:35:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2023-11-29 06:35:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 138 states have internal predecessors, (192), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-11-29 06:35:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2023-11-29 06:35:47,673 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 57 [2023-11-29 06:35:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:47,673 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2023-11-29 06:35:47,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-29 06:35:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2023-11-29 06:35:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:35:47,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:47,676 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] [2023-11-29 06:35:47,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:35:47,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:47,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2030424501, now seen corresponding path program 1 times [2023-11-29 06:35:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16836160] [2023-11-29 06:35:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,850 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-29 06:35:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16836160] [2023-11-29 06:35:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16836160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:35:47,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577299924] [2023-11-29 06:35:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:47,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:35:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:35:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:35:47,853 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-29 06:35:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:48,601 INFO L93 Difference]: Finished difference Result 496 states and 694 transitions. [2023-11-29 06:35:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:35:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2023-11-29 06:35:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:48,606 INFO L225 Difference]: With dead ends: 496 [2023-11-29 06:35:48,606 INFO L226 Difference]: Without dead ends: 334 [2023-11-29 06:35:48,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 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-29 06:35:48,610 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 338 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:48,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 579 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:35:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-29 06:35:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 264. [2023-11-29 06:35:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.4207920792079207) internal successors, (287), 208 states have internal predecessors, (287), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2023-11-29 06:35:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2023-11-29 06:35:48,661 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 57 [2023-11-29 06:35:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:48,661 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2023-11-29 06:35:48,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-29 06:35:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2023-11-29 06:35:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:35:48,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:48,665 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] [2023-11-29 06:35:48,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:35:48,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:48,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash -336270093, now seen corresponding path program 1 times [2023-11-29 06:35:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336803974] [2023-11-29 06:35:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:48,803 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-29 06:35:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336803974] [2023-11-29 06:35:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336803974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:35:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520058832] [2023-11-29 06:35:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:48,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:35:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:35:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:35:48,806 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-29 06:35:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:49,262 INFO L93 Difference]: Finished difference Result 540 states and 759 transitions. [2023-11-29 06:35:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:35:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-11-29 06:35:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:49,265 INFO L225 Difference]: With dead ends: 540 [2023-11-29 06:35:49,265 INFO L226 Difference]: Without dead ends: 296 [2023-11-29 06:35:49,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:35:49,268 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:49,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 379 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-29 06:35:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2023-11-29 06:35:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 211 states have internal predecessors, (288), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-29 06:35:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 372 transitions. [2023-11-29 06:35:49,302 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 372 transitions. Word has length 57 [2023-11-29 06:35:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:49,302 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 372 transitions. [2023-11-29 06:35:49,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-29 06:35:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 372 transitions. [2023-11-29 06:35:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 06:35:49,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:49,305 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] [2023-11-29 06:35:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:35:49,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:49,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1714713905, now seen corresponding path program 1 times [2023-11-29 06:35:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611374100] [2023-11-29 06:35:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:49,409 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-29 06:35:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611374100] [2023-11-29 06:35:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611374100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:35:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157827717] [2023-11-29 06:35:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:35:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:35:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:35:49,412 INFO L87 Difference]: Start difference. First operand 268 states and 372 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 06:35:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:49,935 INFO L93 Difference]: Finished difference Result 804 states and 1105 transitions. [2023-11-29 06:35:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:35:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-11-29 06:35:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:49,940 INFO L225 Difference]: With dead ends: 804 [2023-11-29 06:35:49,940 INFO L226 Difference]: Without dead ends: 556 [2023-11-29 06:35:49,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:35:49,943 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 466 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:49,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 335 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:35:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-11-29 06:35:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 485. [2023-11-29 06:35:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 382 states have internal predecessors, (511), 60 states have call successors, (60), 43 states have call predecessors, (60), 52 states have return successors, (81), 62 states have call predecessors, (81), 58 states have call successors, (81) [2023-11-29 06:35:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 652 transitions. [2023-11-29 06:35:50,012 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 652 transitions. Word has length 57 [2023-11-29 06:35:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:50,012 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 652 transitions. [2023-11-29 06:35:50,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 06:35:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 652 transitions. [2023-11-29 06:35:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:35:50,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:50,014 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] [2023-11-29 06:35:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:35:50,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:50,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1503158972, now seen corresponding path program 1 times [2023-11-29 06:35:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414679944] [2023-11-29 06:35:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,138 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-29 06:35:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414679944] [2023-11-29 06:35:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414679944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:35:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889718994] [2023-11-29 06:35:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:50,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:35:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:35:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:35:50,141 INFO L87 Difference]: Start difference. First operand 485 states and 652 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 06:35:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:50,576 INFO L93 Difference]: Finished difference Result 1014 states and 1363 transitions. [2023-11-29 06:35:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:35:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2023-11-29 06:35:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:50,580 INFO L225 Difference]: With dead ends: 1014 [2023-11-29 06:35:50,580 INFO L226 Difference]: Without dead ends: 549 [2023-11-29 06:35:50,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:35:50,583 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:50,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 421 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-11-29 06:35:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 497. [2023-11-29 06:35:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 381 states have (on average 1.356955380577428) internal successors, (517), 391 states have internal predecessors, (517), 60 states have call successors, (60), 43 states have call predecessors, (60), 55 states have return successors, (84), 65 states have call predecessors, (84), 58 states have call successors, (84) [2023-11-29 06:35:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2023-11-29 06:35:50,629 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 58 [2023-11-29 06:35:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:50,630 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2023-11-29 06:35:50,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 06:35:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2023-11-29 06:35:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:35:50,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:50,632 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] [2023-11-29 06:35:50,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:35:50,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:50,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash -868580290, now seen corresponding path program 1 times [2023-11-29 06:35:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:50,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280262873] [2023-11-29 06:35:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:50,803 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-29 06:35:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280262873] [2023-11-29 06:35:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280262873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:50,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:35:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018408943] [2023-11-29 06:35:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:35:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:35:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:35:50,805 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-29 06:35:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:51,441 INFO L93 Difference]: Finished difference Result 1071 states and 1388 transitions. [2023-11-29 06:35:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:35:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2023-11-29 06:35:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:51,446 INFO L225 Difference]: With dead ends: 1071 [2023-11-29 06:35:51,446 INFO L226 Difference]: Without dead ends: 664 [2023-11-29 06:35:51,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:35:51,464 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 302 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:51,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 339 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:35:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2023-11-29 06:35:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 505. [2023-11-29 06:35:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.347938144329897) internal successors, (523), 397 states have internal predecessors, (523), 61 states have call successors, (61), 44 states have call predecessors, (61), 55 states have return successors, (81), 66 states have call predecessors, (81), 59 states have call successors, (81) [2023-11-29 06:35:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 665 transitions. [2023-11-29 06:35:51,512 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 665 transitions. Word has length 58 [2023-11-29 06:35:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:51,513 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 665 transitions. [2023-11-29 06:35:51,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-29 06:35:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 665 transitions. [2023-11-29 06:35:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:35:51,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:51,515 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] [2023-11-29 06:35:51,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:35:51,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:51,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash -649725572, now seen corresponding path program 1 times [2023-11-29 06:35:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449532065] [2023-11-29 06:35:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:51,616 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-29 06:35:51,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449532065] [2023-11-29 06:35:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449532065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:35:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686558046] [2023-11-29 06:35:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:51,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:35:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:35:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:35:51,618 INFO L87 Difference]: Start difference. First operand 505 states and 665 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 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-29 06:35:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:52,066 INFO L93 Difference]: Finished difference Result 1536 states and 2010 transitions. [2023-11-29 06:35:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:35:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 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 58 [2023-11-29 06:35:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:52,074 INFO L225 Difference]: With dead ends: 1536 [2023-11-29 06:35:52,075 INFO L226 Difference]: Without dead ends: 1054 [2023-11-29 06:35:52,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:35:52,077 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 276 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:52,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 271 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2023-11-29 06:35:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 962. [2023-11-29 06:35:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 728 states have (on average 1.3104395604395604) internal successors, (954), 748 states have internal predecessors, (954), 121 states have call successors, (121), 87 states have call predecessors, (121), 112 states have return successors, (177), 132 states have call predecessors, (177), 119 states have call successors, (177) [2023-11-29 06:35:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1252 transitions. [2023-11-29 06:35:52,191 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1252 transitions. Word has length 58 [2023-11-29 06:35:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:52,191 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1252 transitions. [2023-11-29 06:35:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 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-29 06:35:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1252 transitions. [2023-11-29 06:35:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:35:52,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:52,194 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] [2023-11-29 06:35:52,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:35:52,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:52,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2016957774, now seen corresponding path program 1 times [2023-11-29 06:35:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023450418] [2023-11-29 06:35:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,269 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-29 06:35:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023450418] [2023-11-29 06:35:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023450418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:52,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:52,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:35:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513058893] [2023-11-29 06:35:52,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:52,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:35:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:35:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:35:52,271 INFO L87 Difference]: Start difference. First operand 962 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:35:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:52,745 INFO L93 Difference]: Finished difference Result 2922 states and 3799 transitions. [2023-11-29 06:35:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:35:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-11-29 06:35:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:52,757 INFO L225 Difference]: With dead ends: 2922 [2023-11-29 06:35:52,757 INFO L226 Difference]: Without dead ends: 1962 [2023-11-29 06:35:52,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:35:52,761 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 283 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:52,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 222 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2023-11-29 06:35:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1778. [2023-11-29 06:35:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1346 states have (on average 1.2942050520059436) internal successors, (1742), 1372 states have internal predecessors, (1742), 215 states have call successors, (215), 173 states have call predecessors, (215), 216 states have return successors, (315), 238 states have call predecessors, (315), 213 states have call successors, (315) [2023-11-29 06:35:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2272 transitions. [2023-11-29 06:35:52,916 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2272 transitions. Word has length 59 [2023-11-29 06:35:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:52,916 INFO L495 AbstractCegarLoop]: Abstraction has 1778 states and 2272 transitions. [2023-11-29 06:35:52,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:35:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2272 transitions. [2023-11-29 06:35:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 06:35:52,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:52,918 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-29 06:35:52,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:35:52,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:52,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -321283507, now seen corresponding path program 1 times [2023-11-29 06:35:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718137479] [2023-11-29 06:35:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,007 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-29 06:35:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718137479] [2023-11-29 06:35:53,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718137479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:35:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273528987] [2023-11-29 06:35:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:35:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:35:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:35:53,009 INFO L87 Difference]: Start difference. First operand 1778 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:35:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:53,515 INFO L93 Difference]: Finished difference Result 4442 states and 5658 transitions. [2023-11-29 06:35:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:35:53,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-29 06:35:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:53,528 INFO L225 Difference]: With dead ends: 4442 [2023-11-29 06:35:53,528 INFO L226 Difference]: Without dead ends: 2686 [2023-11-29 06:35:53,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:35:53,531 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 346 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:53,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 218 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:35:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2023-11-29 06:35:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2444. [2023-11-29 06:35:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1848 states have (on average 1.2846320346320346) internal successors, (2374), 1882 states have internal predecessors, (2374), 295 states have call successors, (295), 243 states have call predecessors, (295), 300 states have return successors, (424), 324 states have call predecessors, (424), 293 states have call successors, (424) [2023-11-29 06:35:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3093 transitions. [2023-11-29 06:35:53,711 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3093 transitions. Word has length 65 [2023-11-29 06:35:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:53,712 INFO L495 AbstractCegarLoop]: Abstraction has 2444 states and 3093 transitions. [2023-11-29 06:35:53,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:35:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3093 transitions. [2023-11-29 06:35:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 06:35:53,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:53,715 INFO L195 NwaCegarLoop]: trace histogram [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-29 06:35:53,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:35:53,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:53,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1885701990, now seen corresponding path program 1 times [2023-11-29 06:35:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404447843] [2023-11-29 06:35:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:35:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404447843] [2023-11-29 06:35:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404447843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:35:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440401382] [2023-11-29 06:35:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:53,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:35:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:35:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:35:53,831 INFO L87 Difference]: Start difference. First operand 2444 states and 3093 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:35:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:54,420 INFO L93 Difference]: Finished difference Result 3164 states and 3964 transitions. [2023-11-29 06:35:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:35:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2023-11-29 06:35:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:54,435 INFO L225 Difference]: With dead ends: 3164 [2023-11-29 06:35:54,435 INFO L226 Difference]: Without dead ends: 3161 [2023-11-29 06:35:54,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:35:54,437 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 438 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:54,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 242 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2023-11-29 06:35:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2894. [2023-11-29 06:35:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2189 states have (on average 1.277295568752855) internal successors, (2796), 2228 states have internal predecessors, (2796), 345 states have call successors, (345), 287 states have call predecessors, (345), 359 states have return successors, (503), 384 states have call predecessors, (503), 344 states have call successors, (503) [2023-11-29 06:35:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3644 transitions. [2023-11-29 06:35:54,666 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3644 transitions. Word has length 66 [2023-11-29 06:35:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:54,666 INFO L495 AbstractCegarLoop]: Abstraction has 2894 states and 3644 transitions. [2023-11-29 06:35:54,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:35:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3644 transitions. [2023-11-29 06:35:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 06:35:54,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:54,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:35:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:35:54,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:54,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1672428599, now seen corresponding path program 1 times [2023-11-29 06:35:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702471313] [2023-11-29 06:35:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:35:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702471313] [2023-11-29 06:35:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702471313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:35:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687894358] [2023-11-29 06:35:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:35:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:35:54,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:35:54,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:35:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:54,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:35:54,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:35:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:35:55,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:35:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:35:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687894358] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:35:55,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:35:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2023-11-29 06:35:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664529603] [2023-11-29 06:35:55,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:35:55,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:35:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:35:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:35:55,263 INFO L87 Difference]: Start difference. First operand 2894 states and 3644 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 06:35:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:56,829 INFO L93 Difference]: Finished difference Result 6961 states and 8720 transitions. [2023-11-29 06:35:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 06:35:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 67 [2023-11-29 06:35:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:56,860 INFO L225 Difference]: With dead ends: 6961 [2023-11-29 06:35:56,860 INFO L226 Difference]: Without dead ends: 6958 [2023-11-29 06:35:56,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:35:56,864 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 865 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:56,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 631 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:35:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6958 states. [2023-11-29 06:35:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6958 to 4520. [2023-11-29 06:35:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 3429 states have (on average 1.2820064158646836) internal successors, (4396), 3490 states have internal predecessors, (4396), 529 states have call successors, (529), 445 states have call predecessors, (529), 561 states have return successors, (781), 590 states have call predecessors, (781), 528 states have call successors, (781) [2023-11-29 06:35:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 5706 transitions. [2023-11-29 06:35:57,295 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 5706 transitions. Word has length 67 [2023-11-29 06:35:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:57,295 INFO L495 AbstractCegarLoop]: Abstraction has 4520 states and 5706 transitions. [2023-11-29 06:35:57,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 06:35:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 5706 transitions. [2023-11-29 06:35:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 06:35:57,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:57,298 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 06:35:57,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:35:57,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:35:57,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:57,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1152070234, now seen corresponding path program 2 times [2023-11-29 06:35:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751815193] [2023-11-29 06:35:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:35:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751815193] [2023-11-29 06:35:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751815193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:35:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556025295] [2023-11-29 06:35:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:57,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:35:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:35:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:35:57,566 INFO L87 Difference]: Start difference. First operand 4520 states and 5706 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:35:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:58,212 INFO L93 Difference]: Finished difference Result 6976 states and 8835 transitions. [2023-11-29 06:35:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:35:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2023-11-29 06:35:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:58,233 INFO L225 Difference]: With dead ends: 6976 [2023-11-29 06:35:58,233 INFO L226 Difference]: Without dead ends: 3273 [2023-11-29 06:35:58,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:35:58,242 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 197 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:58,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 336 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:35:58,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2023-11-29 06:35:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3044. [2023-11-29 06:35:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2309 states have (on average 1.2559549588566479) internal successors, (2900), 2348 states have internal predecessors, (2900), 361 states have call successors, (361), 301 states have call predecessors, (361), 373 states have return successors, (507), 400 states have call predecessors, (507), 360 states have call successors, (507) [2023-11-29 06:35:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3768 transitions. [2023-11-29 06:35:58,597 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3768 transitions. Word has length 70 [2023-11-29 06:35:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:58,597 INFO L495 AbstractCegarLoop]: Abstraction has 3044 states and 3768 transitions. [2023-11-29 06:35:58,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:35:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3768 transitions. [2023-11-29 06:35:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 06:35:58,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:58,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:35:58,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:35:58,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:58,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1706112077, now seen corresponding path program 1 times [2023-11-29 06:35:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734618736] [2023-11-29 06:35:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:35:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:35:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:35:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:35:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:35:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:35:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:35:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734618736] [2023-11-29 06:35:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734618736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:35:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252749371] [2023-11-29 06:35:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:35:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:35:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:35:58,750 INFO L87 Difference]: Start difference. First operand 3044 states and 3768 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:36:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:00,047 INFO L93 Difference]: Finished difference Result 9326 states and 11551 transitions. [2023-11-29 06:36:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 06:36:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2023-11-29 06:36:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:00,077 INFO L225 Difference]: With dead ends: 9326 [2023-11-29 06:36:00,077 INFO L226 Difference]: Without dead ends: 5105 [2023-11-29 06:36:00,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:36:00,088 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 487 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:00,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 432 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:36:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2023-11-29 06:36:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 4785. [2023-11-29 06:36:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 3593 states have (on average 1.239354300027832) internal successors, (4453), 3675 states have internal predecessors, (4453), 565 states have call successors, (565), 475 states have call predecessors, (565), 626 states have return successors, (889), 640 states have call predecessors, (889), 564 states have call successors, (889) [2023-11-29 06:36:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 5907 transitions. [2023-11-29 06:36:00,634 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 5907 transitions. Word has length 75 [2023-11-29 06:36:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:00,635 INFO L495 AbstractCegarLoop]: Abstraction has 4785 states and 5907 transitions. [2023-11-29 06:36:00,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 06:36:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 5907 transitions. [2023-11-29 06:36:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 06:36:00,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:00,639 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:36:00,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:36:00,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:00,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1385832991, now seen corresponding path program 1 times [2023-11-29 06:36:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829509274] [2023-11-29 06:36:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:36:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:36:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829509274] [2023-11-29 06:36:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829509274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:36:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173290037] [2023-11-29 06:36:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:00,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:36:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:36:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:36:00,774 INFO L87 Difference]: Start difference. First operand 4785 states and 5907 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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-29 06:36:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:02,074 INFO L93 Difference]: Finished difference Result 8456 states and 10398 transitions. [2023-11-29 06:36:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 06:36:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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 85 [2023-11-29 06:36:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:02,097 INFO L225 Difference]: With dead ends: 8456 [2023-11-29 06:36:02,097 INFO L226 Difference]: Without dead ends: 4276 [2023-11-29 06:36:02,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:36:02,109 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 983 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:02,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 444 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:36:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2023-11-29 06:36:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3942. [2023-11-29 06:36:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2963 states have (on average 1.2274721565980424) internal successors, (3637), 3027 states have internal predecessors, (3637), 466 states have call successors, (466), 390 states have call predecessors, (466), 512 states have return successors, (667), 530 states have call predecessors, (667), 465 states have call successors, (667) [2023-11-29 06:36:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4770 transitions. [2023-11-29 06:36:02,562 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4770 transitions. Word has length 85 [2023-11-29 06:36:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:02,562 INFO L495 AbstractCegarLoop]: Abstraction has 3942 states and 4770 transitions. [2023-11-29 06:36:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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-29 06:36:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4770 transitions. [2023-11-29 06:36:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 06:36:02,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:02,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 06:36:02,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:36:02,571 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:02,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1071877003, now seen corresponding path program 1 times [2023-11-29 06:36:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809688666] [2023-11-29 06:36:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:36:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:36:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:36:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 06:36:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:36:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:36:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 06:36:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 06:36:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809688666] [2023-11-29 06:36:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809688666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:36:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881836108] [2023-11-29 06:36:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:02,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:36:02,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:36:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:02,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:36:02,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:36:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:36:02,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:36:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881836108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:36:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 06:36:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107909965] [2023-11-29 06:36:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:02,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:36:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:36:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:36:02,883 INFO L87 Difference]: Start difference. First operand 3942 states and 4770 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 06:36:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:03,101 INFO L93 Difference]: Finished difference Result 5914 states and 7182 transitions. [2023-11-29 06:36:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:36:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2023-11-29 06:36:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:03,110 INFO L225 Difference]: With dead ends: 5914 [2023-11-29 06:36:03,110 INFO L226 Difference]: Without dead ends: 1998 [2023-11-29 06:36:03,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:36:03,118 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:03,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 529 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:36:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2023-11-29 06:36:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1873. [2023-11-29 06:36:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1471 states have (on average 1.2107409925220938) internal successors, (1781), 1484 states have internal predecessors, (1781), 190 states have call successors, (190), 156 states have call predecessors, (190), 211 states have return successors, (274), 232 states have call predecessors, (274), 189 states have call successors, (274) [2023-11-29 06:36:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2245 transitions. [2023-11-29 06:36:03,336 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2245 transitions. Word has length 130 [2023-11-29 06:36:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:03,336 INFO L495 AbstractCegarLoop]: Abstraction has 1873 states and 2245 transitions. [2023-11-29 06:36:03,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 06:36:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2245 transitions. [2023-11-29 06:36:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 06:36:03,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:03,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2023-11-29 06:36:03,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:36:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 06:36:03,542 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:03,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash -11543539, now seen corresponding path program 1 times [2023-11-29 06:36:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558633947] [2023-11-29 06:36:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:36:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:36:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:36:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 06:36:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 06:36:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 06:36:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 06:36:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-29 06:36:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558633947] [2023-11-29 06:36:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558633947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:03,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:36:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321719813] [2023-11-29 06:36:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:03,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:36:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:36:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:36:03,619 INFO L87 Difference]: Start difference. First operand 1873 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 06:36:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:03,918 INFO L93 Difference]: Finished difference Result 1938 states and 2313 transitions. [2023-11-29 06:36:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:36:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 132 [2023-11-29 06:36:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:03,923 INFO L225 Difference]: With dead ends: 1938 [2023-11-29 06:36:03,924 INFO L226 Difference]: Without dead ends: 1536 [2023-11-29 06:36:03,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:36:03,926 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 205 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:03,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 179 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:36:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2023-11-29 06:36:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1474. [2023-11-29 06:36:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1168 states have (on average 1.216609589041096) internal successors, (1421), 1178 states have internal predecessors, (1421), 144 states have call successors, (144), 116 states have call predecessors, (144), 161 states have return successors, (210), 179 states have call predecessors, (210), 143 states have call successors, (210) [2023-11-29 06:36:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1775 transitions. [2023-11-29 06:36:04,024 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1775 transitions. Word has length 132 [2023-11-29 06:36:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:04,024 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 1775 transitions. [2023-11-29 06:36:04,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 06:36:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1775 transitions. [2023-11-29 06:36:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 06:36:04,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:04,027 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2023-11-29 06:36:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:36:04,027 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:04,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1296350980, now seen corresponding path program 1 times [2023-11-29 06:36:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474657791] [2023-11-29 06:36:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 06:36:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:36:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:36:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 06:36:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 06:36:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 06:36:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 06:36:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 06:36:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474657791] [2023-11-29 06:36:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474657791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:36:04,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154901789] [2023-11-29 06:36:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:04,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:36:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:36:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:36:04,126 INFO L87 Difference]: Start difference. First operand 1474 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 06:36:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:04,565 INFO L93 Difference]: Finished difference Result 2821 states and 3428 transitions. [2023-11-29 06:36:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:36:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 144 [2023-11-29 06:36:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:04,573 INFO L225 Difference]: With dead ends: 2821 [2023-11-29 06:36:04,573 INFO L226 Difference]: Without dead ends: 1581 [2023-11-29 06:36:04,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:36:04,577 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:04,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 385 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:36:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2023-11-29 06:36:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1399. [2023-11-29 06:36:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1115 states have (on average 1.2161434977578476) internal successors, (1356), 1126 states have internal predecessors, (1356), 135 states have call successors, (135), 111 states have call predecessors, (135), 148 states have return successors, (194), 161 states have call predecessors, (194), 134 states have call successors, (194) [2023-11-29 06:36:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1685 transitions. [2023-11-29 06:36:04,729 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1685 transitions. Word has length 144 [2023-11-29 06:36:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:04,729 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1685 transitions. [2023-11-29 06:36:04,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 06:36:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1685 transitions. [2023-11-29 06:36:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 06:36:04,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:04,733 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:36:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:36:04,734 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:04,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1858663312, now seen corresponding path program 1 times [2023-11-29 06:36:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:04,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546636651] [2023-11-29 06:36:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 06:36:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:36:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 06:36:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 06:36:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 06:36:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 06:36:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:36:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 06:36:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546636651] [2023-11-29 06:36:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546636651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:36:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439280803] [2023-11-29 06:36:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:05,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:05,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:36:05,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:36:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:05,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:36:05,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:36:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 06:36:05,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:36:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 06:36:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439280803] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:36:05,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:36:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2023-11-29 06:36:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667571290] [2023-11-29 06:36:05,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:36:05,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:36:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:36:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:36:05,505 INFO L87 Difference]: Start difference. First operand 1399 states and 1685 transitions. Second operand has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 06:36:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:06,387 INFO L93 Difference]: Finished difference Result 3206 states and 3967 transitions. [2023-11-29 06:36:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 06:36:06,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 146 [2023-11-29 06:36:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:06,395 INFO L225 Difference]: With dead ends: 3206 [2023-11-29 06:36:06,395 INFO L226 Difference]: Without dead ends: 1904 [2023-11-29 06:36:06,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:36:06,399 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 818 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:06,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 288 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:36:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2023-11-29 06:36:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1760. [2023-11-29 06:36:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1364 states have (on average 1.1979472140762464) internal successors, (1634), 1383 states have internal predecessors, (1634), 189 states have call successors, (189), 161 states have call predecessors, (189), 206 states have return successors, (308), 215 states have call predecessors, (308), 188 states have call successors, (308) [2023-11-29 06:36:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2131 transitions. [2023-11-29 06:36:06,614 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2131 transitions. Word has length 146 [2023-11-29 06:36:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:06,615 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2131 transitions. [2023-11-29 06:36:06,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 06:36:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2131 transitions. [2023-11-29 06:36:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 06:36:06,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:06,619 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 06:36:06,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 06:36:06,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:06,820 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:06,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1899535245, now seen corresponding path program 1 times [2023-11-29 06:36:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564508791] [2023-11-29 06:36:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 06:36:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:36:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:36:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:36:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:36:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:36:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 06:36:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:36:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 06:36:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 06:36:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 06:36:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:36:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-29 06:36:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564508791] [2023-11-29 06:36:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564508791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:36:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461244535] [2023-11-29 06:36:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:06,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:06,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:36:06,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:36:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:36:07,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:36:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-29 06:36:07,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:36:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461244535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:36:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-29 06:36:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238994644] [2023-11-29 06:36:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:07,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:36:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:36:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:36:07,117 INFO L87 Difference]: Start difference. First operand 1760 states and 2131 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 06:36:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:07,394 INFO L93 Difference]: Finished difference Result 3428 states and 4169 transitions. [2023-11-29 06:36:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:36:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 161 [2023-11-29 06:36:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:07,398 INFO L225 Difference]: With dead ends: 3428 [2023-11-29 06:36:07,398 INFO L226 Difference]: Without dead ends: 1494 [2023-11-29 06:36:07,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:36:07,402 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 142 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:07,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 206 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:36:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2023-11-29 06:36:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1456. [2023-11-29 06:36:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1137 states have (on average 1.187335092348285) internal successors, (1350), 1149 states have internal predecessors, (1350), 154 states have call successors, (154), 130 states have call predecessors, (154), 164 states have return successors, (234), 176 states have call predecessors, (234), 153 states have call successors, (234) [2023-11-29 06:36:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1738 transitions. [2023-11-29 06:36:07,523 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1738 transitions. Word has length 161 [2023-11-29 06:36:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:07,523 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1738 transitions. [2023-11-29 06:36:07,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 06:36:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1738 transitions. [2023-11-29 06:36:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-29 06:36:07,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:07,526 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 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, 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] [2023-11-29 06:36:07,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:36:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:07,726 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:07,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1819492835, now seen corresponding path program 1 times [2023-11-29 06:36:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147095404] [2023-11-29 06:36:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 06:36:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:36:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 06:36:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 06:36:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 06:36:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 06:36:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:36:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 06:36:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 06:36:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 06:36:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 06:36:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 06:36:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 06:36:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-29 06:36:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-29 06:36:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147095404] [2023-11-29 06:36:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147095404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:36:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543282904] [2023-11-29 06:36:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:07,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:07,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:36:07,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:36:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:07,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:36:07,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:36:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 06:36:08,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:36:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543282904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:08,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:36:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-11-29 06:36:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455160250] [2023-11-29 06:36:08,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:08,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:36:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:36:08,033 INFO L87 Difference]: Start difference. First operand 1456 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:36:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:08,171 INFO L93 Difference]: Finished difference Result 2799 states and 3391 transitions. [2023-11-29 06:36:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 228 [2023-11-29 06:36:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:08,174 INFO L225 Difference]: With dead ends: 2799 [2023-11-29 06:36:08,174 INFO L226 Difference]: Without dead ends: 1431 [2023-11-29 06:36:08,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:36:08,177 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:08,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 220 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:36:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-11-29 06:36:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1426. [2023-11-29 06:36:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1111 states have (on average 1.171917191719172) internal successors, (1302), 1123 states have internal predecessors, (1302), 154 states have call successors, (154), 130 states have call predecessors, (154), 160 states have return successors, (230), 172 states have call predecessors, (230), 153 states have call successors, (230) [2023-11-29 06:36:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1686 transitions. [2023-11-29 06:36:08,289 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1686 transitions. Word has length 228 [2023-11-29 06:36:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:08,289 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 1686 transitions. [2023-11-29 06:36:08,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:36:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1686 transitions. [2023-11-29 06:36:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-29 06:36:08,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:36:08,291 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 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, 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] [2023-11-29 06:36:08,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 06:36:08,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:08,493 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:36:08,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1143729042, now seen corresponding path program 1 times [2023-11-29 06:36:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:08,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655424916] [2023-11-29 06:36:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:36:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 06:36:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 06:36:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 06:36:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:36:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 06:36:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 06:36:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 06:36:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 06:36:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 06:36:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 06:36:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 06:36:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 06:36:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 06:36:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:36:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:36:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 06:36:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 06:36:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 06:36:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-29 06:36:08,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655424916] [2023-11-29 06:36:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655424916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:36:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141150197] [2023-11-29 06:36:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:08,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:08,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:36:08,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:36:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:08,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:36:08,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:36:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 06:36:08,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:36:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-29 06:36:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141150197] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:36:09,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:36:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-11-29 06:36:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764346747] [2023-11-29 06:36:09,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:36:09,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:36:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:36:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:36:09,130 INFO L87 Difference]: Start difference. First operand 1426 states and 1686 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 06:36:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:09,707 INFO L93 Difference]: Finished difference Result 1757 states and 2058 transitions. [2023-11-29 06:36:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:36:09,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 229 [2023-11-29 06:36:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:36:09,711 INFO L225 Difference]: With dead ends: 1757 [2023-11-29 06:36:09,711 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:36:09,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 503 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:36:09,713 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 238 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:36:09,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 334 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:36:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:36:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:36:09,714 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-29 06:36:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:36:09,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2023-11-29 06:36:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:36:09,715 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:36:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 06:36:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:36:09,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:36:09,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:36:09,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:36:09,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:36:09,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:36:22,580 WARN L293 SmtUtils]: Spent 9.75s on a formula simplification. DAG size of input: 81 DAG size of output: 38 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 06:36:33,938 WARN L293 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 85 DAG size of output: 42 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 06:36:43,000 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2023-11-29 06:36:43,000 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2023-11-29 06:36:43,001 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2023-11-29 06:36:43,001 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse5 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< 0 ~q_req_up~0)) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse17)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (< ~q_write_ev~0 2)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse2 .cse3 .cse13 .cse8 .cse11) (or .cse0 .cse12 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse15 .cse3 .cse16 (and .cse17 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11) (or .cse12 .cse2 .cse14 .cse15 .cse3 .cse16 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11)))) [2023-11-29 06:36:43,001 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse21 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse22 (= activate_threads_~tmp~1 0))) (let ((.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse8 (< ~q_write_ev~0 2)) (.cse11 (< ~c_dr_pc~0 1)) (.cse0 (and .cse21 .cse14 .cse22)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse1 (< 0 ~q_req_up~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse5 (not (= ~p_dw_i~0 1))) (.cse16 (not .cse2)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse13 (not (= ~c_dr_pc~0 0))) (.cse19 (and .cse21 .cse14)) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~p_dw_pc~0 0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse3 .cse15 .cse7 .cse16 .cse12) (or (and (= ~q_read_ev~0 1) .cse17 .cse18) .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 (= ~q_write_ev~0 0) .cse20 .cse5 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse9 .cse12) (or (and .cse17 .cse18) .cse13 .cse19 .cse3 .cse15 .cse7 .cse12) (or .cse13 .cse3 .cse15 .cse7 (and .cse21 .cse22) .cse9 .cse12) (or .cse1 .cse13 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse23 .cse24 .cse3 .cse25 (and .cse14 .cse22 .cse18) .cse5 .cse6 .cse16 .cse9 .cse10 .cse12) (or .cse13 .cse23 .cse24 .cse3 .cse25 .cse22 .cse6 .cse7 .cse9 .cse10 .cse12) (or .cse13 .cse19 .cse23 .cse24 .cse3 .cse25 .cse6 .cse7 .cse10 .cse12)))) [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 331) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse5 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< 0 ~q_req_up~0)) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse17)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (< ~q_write_ev~0 2)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse2 .cse3 .cse13 .cse8 .cse11) (or .cse0 .cse12 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse15 .cse3 .cse16 (and .cse17 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11) (or .cse12 .cse2 .cse14 .cse15 .cse3 .cse16 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11)))) [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L899 garLoopResultBuilder]: For program point L267(lines 254 269) no Hoare annotation was computed. [2023-11-29 06:36:43,002 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 251 270) the Hoare annotation is: true [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point L95(lines 83 97) no Hoare annotation was computed. [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2023-11-29 06:36:43,003 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 80 98) the Hoare annotation is: true [2023-11-29 06:36:43,003 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 271 288) the Hoare annotation is: (let ((.cse20 (= ~q_read_ev~0 2)) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse17 (< ~c_dr_pc~0 1)) (.cse10 (< |old(~q_write_ev~0)| 2)) (.cse18 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse5 (and .cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse11 (< 0 ~q_req_up~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (and .cse21 .cse20)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse18 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse5 .cse18 .cse13 .cse19 .cse15 .cse7 .cse8 .cse9) (or (not .cse13) .cse11 (and (= ~q_write_ev~0 2) .cse20) .cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse2 .cse3 .cse4 .cse6 .cse14 .cse15 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse9) (or .cse0 .cse11 .cse4 .cse12 .cse13 .cse14 .cse19 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse9)))) [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2023-11-29 06:36:43,004 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2023-11-29 06:36:43,005 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 218 232) the Hoare annotation is: (let ((.cse3 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse5 (= ~q_read_ev~0 2))) (let ((.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse20 (not (= |old(~q_req_up~0)| 1))) (.cse23 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse17 (and .cse3 .cse25 .cse4 .cse5)) (.cse10 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_free~0 0))) (.cse0 (< 0 |old(~q_req_up~0)|)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (< |old(~q_write_ev~0)| 2)) (.cse21 (and .cse3 .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse4)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse1 (= ~p_dw_st~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not .cse1) .cse2 (and .cse3 (= ~q_write_ev~0 2) .cse4 .cse5) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse16 .cse17 .cse8 .cse18 .cse1 .cse10 .cse11 .cse19 .cse14) (or .cse15 .cse16 .cse20 .cse21 .cse8 .cse18 .cse1 .cse10 .cse22 .cse11 .cse23 .cse14) (or .cse15 .cse21 .cse2 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (or .cse15 (< |old(~q_read_ev~0)| 1) .cse16 .cse20 .cse21 .cse8 .cse24 .cse1 .cse22 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse17 .cse8 .cse18 .cse1 .cse10 .cse22 .cse11 (= |old(~q_write_ev~0)| 0) .cse23 .cse14) (or .cse0 .cse15 .cse16 .cse17 .cse8 .cse24 .cse1 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14) (or .cse15 .cse21 .cse2 .cse8 .cse18 .cse14) (or .cse0 .cse15 .cse16 .cse21 .cse8 .cse24 .cse1 .cse22 .cse11 .cse12 .cse13 .cse14)))) [2023-11-29 06:36:43,005 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-29 06:36:43,005 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-11-29 06:36:43,005 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2023-11-29 06:36:43,006 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 289 306) the Hoare annotation is: (let ((.cse22 (= ~q_read_ev~0 2)) (.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse13 (not (= ~p_num_write~0 0))) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse15 (and .cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (< |old(~q_write_ev~0)| 1)) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (and .cse23 .cse22)) (.cse21 (< ~c_dr_pc~0 1)) (.cse11 (= ~c_dr_st~0 0)) (.cse19 (< |old(~q_write_ev~0)| 2)) (.cse1 (< 0 ~q_req_up~0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 .cse17 .cse18 .cse10) (or .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~q_write_ev~0)| 0) .cse8 .cse9 .cse10) (or .cse11 .cse19 .cse1 .cse2 .cse20 .cse4 .cse5 .cse7 .cse17 .cse18 .cse9 .cse21 .cse10) (or .cse11 .cse19 .cse1 .cse2 .cse15 .cse20 .cse4 .cse6 .cse7 .cse17 .cse18 .cse10) (or (not .cse4) .cse1 (and (= ~q_write_ev~0 2) .cse22) .cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse13 .cse14 .cse2 .cse16 .cse5 .cse7 .cse17 .cse18 .cse10) (or .cse11 .cse12 .cse2 .cse15 .cse3 .cse10) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse21 .cse10) (or .cse11 (and (= ~q_read_ev~0 1) .cse23) .cse19 .cse1 .cse2 .cse20 (not (= |old(~q_read_ev~0)| 1)) .cse6 .cse7 .cse17 .cse18 .cse10)))) [2023-11-29 06:36:43,006 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2023-11-29 06:36:43,006 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2023-11-29 06:36:43,006 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-29 06:36:43,006 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2023-11-29 06:36:43,006 INFO L899 garLoopResultBuilder]: For program point L242-1(lines 233 250) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (<= ~q_req_up~0 0)) (.cse16 (<= 1 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse13 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse11 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse15 .cse5 .cse6 .cse11 .cse8 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse13 .cse6 .cse11 .cse7 .cse8 .cse16 .cse14 .cse9))) [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 124 163) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 405 447) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-11-29 06:36:43,007 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse2 (= ~q_free~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse12 .cse13) (and .cse11 .cse1 .cse14 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse14 .cse3 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse4 .cse5 .cse13 .cse10) (and .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9))) [2023-11-29 06:36:43,007 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 165 217) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L401(lines 390 403) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2023-11-29 06:36:43,008 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2023-11-29 06:36:43,009 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse14 (<= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 (<= 1 ~q_read_ev~0) .cse10 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse14 .cse10 .cse13) (and .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse16 .cse12 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse13) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse12 .cse5 .cse6 .cse15 .cse13) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse10))) [2023-11-29 06:36:43,009 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2023-11-29 06:36:43,009 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2023-11-29 06:36:43,009 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 419 441) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse2 (= ~q_free~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not .cse15)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse8 .cse16 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse17 .cse16) (and .cse11 .cse1 .cse18 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse18 .cse3 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse11 .cse1 .cse19 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9)))) [2023-11-29 06:36:43,009 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2023-11-29 06:36:43,009 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 332 385) no Hoare annotation was computed. [2023-11-29 06:36:43,009 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 139 157) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse13 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (<= 1 ~q_read_ev~0)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse9 .cse10) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse5 .cse15) (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse4 .cse5 .cse6 .cse15) (and .cse12 .cse1 .cse13 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11 .cse15 .cse16 .cse10) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse15 .cse16 .cse10 (= ~p_num_write~0 1)))) [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2023-11-29 06:36:43,010 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2023-11-29 06:36:43,011 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:36:43,011 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2023-11-29 06:36:43,011 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2023-11-29 06:36:43,011 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 0)) (.cse17 (= ~p_num_write~0 0)) (.cse2 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse15 (<= 1 ~q_read_ev~0)) (.cse12 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse14 .cse20) (and .cse12 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 .cse5 .cse20 .cse10) (and .cse11 .cse12 .cse18 .cse1 .cse3 .cse5 .cse14 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse20 .cse15 .cse9 (= ~p_num_write~0 1)) (and .cse12 .cse1 .cse21 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9)))) [2023-11-29 06:36:43,011 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2023-11-29 06:36:43,011 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-29 06:36:43,012 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-29 06:36:43,012 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 0)) (.cse17 (= ~p_num_write~0 0)) (.cse2 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse15 (<= 1 ~q_read_ev~0)) (.cse12 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse14 .cse20) (and .cse12 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 .cse5 .cse20 .cse10) (and .cse11 .cse12 .cse18 .cse1 .cse3 .cse5 .cse14 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse20 .cse15 .cse9 (= ~p_num_write~0 1)) (and .cse12 .cse1 .cse21 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9)))) [2023-11-29 06:36:43,012 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2023-11-29 06:36:43,012 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 180 211) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse10)) (.cse8 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (let ((.cse12 (= 1 ~c_dr_i~0))) (or (and (<= 1 ~c_dr_pc~0) .cse12) (and .cse12 (= ~c_dr_pc~0 0))))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse6 (<= 1 ~q_read_ev~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 (= ~q_free~0 0) .cse5 .cse6 .cse7) (and (= ~p_dw_pc~0 0) .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse7 .cse11) (and (= ~q_req_up~0 1) .cse0 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11)))) [2023-11-29 06:36:43,013 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse8 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse11 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse13 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse14 .cse4 .cse5 .cse6 .cse11 .cse8 .cse13 .cse9))) [2023-11-29 06:36:43,013 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse8 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse11 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse13 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse14 .cse4 .cse5 .cse6 .cse11 .cse8 .cse13 .cse9))) [2023-11-29 06:36:43,013 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2023-11-29 06:36:43,013 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2023-11-29 06:36:43,013 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2023-11-29 06:36:43,013 INFO L899 garLoopResultBuilder]: For program point L76(lines 64 78) no Hoare annotation was computed. [2023-11-29 06:36:43,014 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 61 79) the Hoare annotation is: true [2023-11-29 06:36:43,014 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2023-11-29 06:36:43,014 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-29 06:36:43,014 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-29 06:36:43,014 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-29 06:36:43,017 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:36:43,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:36:43,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,032 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,033 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 06:36:43,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:36:43 BoogieIcfgContainer [2023-11-29 06:36:43,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:36:43,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:36:43,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:36:43,050 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:36:43,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:35:45" (3/4) ... [2023-11-29 06:36:43,053 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:36:43,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-29 06:36:43,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-29 06:36:43,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 06:36:43,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-29 06:36:43,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-29 06:36:43,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-29 06:36:43,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 06:36:43,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-29 06:36:43,065 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2023-11-29 06:36:43,066 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 06:36:43,067 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:36:43,067 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:36:43,198 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:36:43,199 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:36:43,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:36:43,200 INFO L158 Benchmark]: Toolchain (without parser) took 58144.86ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.9MB in the beginning and 735.0MB in the end (delta: -630.1MB). Peak memory consumption was 587.5MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,201 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:36:43,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.80ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 91.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.29ms. Allocated memory is still 140.5MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,202 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,202 INFO L158 Benchmark]: RCFGBuilder took 465.84ms. Allocated memory is still 140.5MB. Free memory was 87.3MB in the beginning and 109.0MB in the end (delta: -21.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,203 INFO L158 Benchmark]: TraceAbstraction took 57177.48ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 108.2MB in the beginning and 742.3MB in the end (delta: -634.1MB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,203 INFO L158 Benchmark]: Witness Printer took 149.73ms. Allocated memory is still 1.4GB. Free memory was 742.3MB in the beginning and 735.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 06:36:43,205 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.22ms. Allocated memory is still 104.9MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.80ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 91.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.29ms. Allocated memory is still 140.5MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.84ms. Allocated memory is still 140.5MB. Free memory was 87.3MB in the beginning and 109.0MB in the end (delta: -21.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57177.48ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 108.2MB in the beginning and 742.3MB in the end (delta: -634.1MB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. * Witness Printer took 149.73ms. Allocated memory is still 1.4GB. Free memory was 742.3MB in the beginning and 735.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 33.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7684 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7483 mSDsluCounter, 7397 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5490 mSDsCounter, 1885 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8279 IncrementalHoareTripleChecker+Invalid, 10164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1885 mSolverCounterUnsat, 1907 mSDtfsCounter, 8279 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2272 GetRequests, 1953 SyntacticMatches, 5 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4785occurred in iteration=14, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 5096 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 4002 PreInvPairs, 4272 NumberOfFragments, 5182 HoareAnnotationTreeSize, 4002 FomulaSimplifications, 1978285 FormulaSimplificationTreeSizeReduction, 24.9s HoareSimplificationTime, 26 FomulaSimplificationsInter, 35856 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3077 NumberOfCodeBlocks, 3077 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3488 ConstructedInterpolants, 0 QuantifiedInterpolants, 6515 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3034 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 31 InterpolantComputations, 19 PerfectInterpolantSequences, 2089/2148 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: 180]: Loop Invariant Derived loop invariant: ((((((((((!((p_dw_st == 0)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) || ((((((((((((p_dw_pc == 0) && (c_num_read == p_num_write)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0))) || (((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || (((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1))) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 06:36:43,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87b0f24b-58c9-4151-ade4-ff8bd66504da/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE