./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu --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 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:43,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:43,541 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:00:43,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:43,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:43,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:43,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:43,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:43,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:00:43,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:00:43,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:43,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:43,605 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:43,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:43,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:00:43,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:43,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:00:43,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:43,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:43,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:00:43,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:00:43,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:00:43,612 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:43,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:00:43,613 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:43,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:43,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:43,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:00:43,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:43,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:43,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:00:43,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:00:43,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:00:43,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:00:43,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:00:43,619 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:00:43,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:00:43,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:00:43,620 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:00:43,620 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu 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 -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2023-11-19 08:00:44,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:44,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:44,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:44,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:44,090 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:44,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2023-11-19 08:00:47,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:47,716 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:47,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2023-11-19 08:00:47,734 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/data/f941ca522/aeab805809404f6b871a98be083301b2/FLAGc0fdf82a1 [2023-11-19 08:00:47,750 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/data/f941ca522/aeab805809404f6b871a98be083301b2 [2023-11-19 08:00:47,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:47,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:47,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:47,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:47,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:47,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:47" (1/1) ... [2023-11-19 08:00:47,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4120a0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:47, skipping insertion in model container [2023-11-19 08:00:47,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:47" (1/1) ... [2023-11-19 08:00:47,846 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:48,362 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-11-19 08:00:48,371 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-11-19 08:00:48,373 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-11-19 08:00:48,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:48,414 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:48,473 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-11-19 08:00:48,477 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-11-19 08:00:48,479 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_a9ba9b05-59c9-48ca-a71b-09601b175bc6/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-11-19 08:00:48,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:48,596 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:48,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48 WrapperNode [2023-11-19 08:00:48,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:48,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:48,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:48,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:48,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,697 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 184 [2023-11-19 08:00:48,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:48,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:48,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:48,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:48,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:48,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:48,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:48,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:48,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (1/1) ... [2023-11-19 08:00:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:48,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:00:48,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:00:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-19 08:00:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-19 08:00:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-11-19 08:00:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-11-19 08:00:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:00:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 08:00:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-19 08:00:48,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-19 08:00:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 08:00:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:00:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 08:00:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:00:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-19 08:00:48,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-19 08:00:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:49,094 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:49,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:00:49,545 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:00:49,555 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:00:49,556 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 08:00:49,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:49 BoogieIcfgContainer [2023-11-19 08:00:49,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:00:49,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:00:49,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:00:49,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:00:49,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:00:47" (1/3) ... [2023-11-19 08:00:49,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616aa9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:49, skipping insertion in model container [2023-11-19 08:00:49,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:48" (2/3) ... [2023-11-19 08:00:49,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616aa9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:49, skipping insertion in model container [2023-11-19 08:00:49,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:49" (3/3) ... [2023-11-19 08:00:49,573 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2023-11-19 08:00:49,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:00:49,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-19 08:00:49,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:00:49,671 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;@718b9097, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:00:49,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 08:00:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:00:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 08:00:49,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:49,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:49,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1466302514, now seen corresponding path program 1 times [2023-11-19 08:00:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519063574] [2023-11-19 08:00:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519063574] [2023-11-19 08:00:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519063574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:00:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344389511] [2023-11-19 08:00:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:49,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:00:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:00:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:00:49,999 INFO L87 Difference]: Start difference. First operand has 73 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-19 08:00:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:50,035 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2023-11-19 08:00:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:00:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2023-11-19 08:00:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:50,048 INFO L225 Difference]: With dead ends: 143 [2023-11-19 08:00:50,049 INFO L226 Difference]: Without dead ends: 68 [2023-11-19 08:00:50,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:00:50,061 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:50,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:00:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-19 08:00:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-19 08:00:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:00:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2023-11-19 08:00:50,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 13 [2023-11-19 08:00:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:50,128 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2023-11-19 08:00:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-19 08:00:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2023-11-19 08:00:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 08:00:50,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:50,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:50,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:00:50,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:50,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash -900105311, now seen corresponding path program 1 times [2023-11-19 08:00:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:50,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842117222] [2023-11-19 08:00:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:50,842 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-19 08:00:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842117222] [2023-11-19 08:00:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842117222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:50,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:50,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:00:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128346732] [2023-11-19 08:00:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:50,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:50,856 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-19 08:00:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:51,287 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-11-19 08:00:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:00:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2023-11-19 08:00:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:51,292 INFO L225 Difference]: With dead ends: 123 [2023-11-19 08:00:51,293 INFO L226 Difference]: Without dead ends: 117 [2023-11-19 08:00:51,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:00:51,295 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 58 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:51,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 286 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:00:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-19 08:00:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2023-11-19 08:00:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-19 08:00:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-11-19 08:00:51,341 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 13 [2023-11-19 08:00:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:51,341 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-11-19 08:00:51,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-19 08:00:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-11-19 08:00:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 08:00:51,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:51,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:51,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:00:51,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:51,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -546965991, now seen corresponding path program 1 times [2023-11-19 08:00:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:51,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055312356] [2023-11-19 08:00:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-19 08:00:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:51,516 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-19 08:00:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055312356] [2023-11-19 08:00:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055312356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:51,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:51,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:00:51,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830645769] [2023-11-19 08:00:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:51,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:00:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:00:51,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:00:51,521 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:00:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:51,709 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2023-11-19 08:00:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:00:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-19 08:00:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:51,721 INFO L225 Difference]: With dead ends: 173 [2023-11-19 08:00:51,724 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 08:00:51,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:00:51,730 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 20 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:51,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:00:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 08:00:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-11-19 08:00:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 08:00:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-11-19 08:00:51,759 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 15 [2023-11-19 08:00:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:51,760 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-11-19 08:00:51,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:00:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-11-19 08:00:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 08:00:51,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:51,763 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] [2023-11-19 08:00:51,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:00:51,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:51,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1707883851, now seen corresponding path program 1 times [2023-11-19 08:00:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:51,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866919021] [2023-11-19 08:00:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 08:00:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 08:00:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 08:00:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866919021] [2023-11-19 08:00:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866919021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:00:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404870991] [2023-11-19 08:00:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:52,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:00:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:52,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:00:52,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:00:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:53,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-19 08:00:53,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:00:53,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 08:00:53,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 08:00:53,727 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-11-19 08:00:53,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2023-11-19 08:00:53,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-19 08:00:53,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:53,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 08:00:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-19 08:00:53,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-19 08:00:53,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:00:53,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:00:54,019 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-11-19 08:00:54,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 63 [2023-11-19 08:00:54,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:00:54,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:00:54,128 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:00:54,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2023-11-19 08:00:54,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:00:54,681 INFO L349 Elim1Store]: treesize reduction 82, result has 37.9 percent of original size [2023-11-19 08:00:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 197 treesize of output 241 [2023-11-19 08:00:55,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 25 [2023-11-19 08:00:55,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 11 [2023-11-19 08:00:55,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 17 [2023-11-19 08:01:02,710 INFO L349 Elim1Store]: treesize reduction 293, result has 29.4 percent of original size [2023-11-19 08:01:02,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 35 case distinctions, treesize of input 3943 treesize of output 3085 [2023-11-19 08:01:03,180 INFO L349 Elim1Store]: treesize reduction 16, result has 93.3 percent of original size [2023-11-19 08:01:03,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 359 treesize of output 524 [2023-11-19 08:01:03,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 217 [2023-11-19 08:01:03,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 215 [2023-11-19 08:01:03,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 213 [2023-11-19 08:01:03,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 288 [2023-11-19 08:01:03,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-19 08:01:03,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-19 08:01:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:04,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:01:04,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:01:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1158 treesize of output 1119 [2023-11-19 08:01:04,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 578 [2023-11-19 08:01:04,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 594 [2023-11-19 08:01:04,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:04,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:01:04,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:01:04,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:04,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-11-19 08:01:04,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:04,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404870991] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:01:05,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:01:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-19 08:01:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430293401] [2023-11-19 08:01:05,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:01:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 08:01:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 08:01:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=887, Unknown=7, NotChecked=0, Total=992 [2023-11-19 08:01:05,053 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 08:01:08,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:01:10,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:01:10,662 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_foo_~me~1#1.base| 4)) (let ((.cse2 (select |c_#memory_$Pointer$.base| 4))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_10 |c_~#drvlist~0.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (and (= (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) 4 v_DerPreprocessor_10) .cse0) .cse1) (not (= .cse0 4)) (= .cse2 (store .cse1 |c_~#drvlist~0.offset| .cse0)))))) (let ((.cse3 (select .cse2 |c_~#drvlist~0.offset|))) (and (not (= .cse3 4)) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse11 (store .cse6 |c_~#drvlist~0.offset| .cse3))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (__ldv_list_add_~next.base Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base))) (let ((.cse5 (let ((.cse8 (store .cse4 |c_~#drvlist~0.offset| .cse3))) (store (let ((.cse7 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_19) .cse3 v_DerPreprocessor_20) 4 .cse8))) (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base (select .cse7 __ldv_list_add_~next.base)) .cse3 (select .cse7 .cse3))) 4 .cse8)))) (and (= .cse4 (select .cse5 __ldv_list_add_~next.base)) (= .cse6 (select .cse5 .cse3)) (not (= __ldv_list_add_~next.base 4)) (not (= .cse3 __ldv_list_add_~next.base)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (__ldv_list_add_~next.base Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base))) (let ((.cse10 (let ((.cse13 (store .cse9 |c_~#drvlist~0.offset| .cse3))) (store (let ((.cse12 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_19) .cse3 v_DerPreprocessor_20) 4 .cse13))) (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base (select .cse12 __ldv_list_add_~next.base)) .cse3 (select .cse12 .cse3))) 4 .cse13)))) (and (= .cse9 (select .cse10 __ldv_list_add_~next.base)) (= .cse9 .cse11) (= .cse6 (select .cse10 .cse3)) (not (= __ldv_list_add_~next.base 4)) (not (= .cse3 __ldv_list_add_~next.base)))))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse16 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) |c_~#drvlist~0.offset| .cse3))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) 4 .cse16)) (.cse14 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_21) .cse3 v_DerPreprocessor_22) 4 .cse16))) (and (= (select .cse14 .cse3) (select .cse15 .cse3)) (not (= __ldv_list_add_~next.base 4)) (not (= .cse3 __ldv_list_add_~next.base)) (= (select .cse15 __ldv_list_add_~next.base) (select .cse14 __ldv_list_add_~next.base)))))) (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= .cse3 (select v_DerPreprocessor_28 |c_~#drvlist~0.offset|)) (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_27) 4 v_DerPreprocessor_28) .cse3)) 4 v_DerPreprocessor_28) .cse3))))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse20 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) |c_~#drvlist~0.offset| .cse3))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_24) .cse3 v_DerPreprocessor_25) 4 .cse20))) (let ((.cse17 (select .cse19 __ldv_list_add_~next.base)) (.cse18 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) 4 .cse20))) (and (= .cse17 v_DerPreprocessor_24) (= (select .cse18 __ldv_list_add_~next.base) .cse17) (= (select .cse18 .cse3) (select .cse19 .cse3)) (not (= .cse3 __ldv_list_add_~next.base))))))) (exists ((v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (and (= .cse3 (select v_DerPreprocessor_34 |c_~#drvlist~0.offset|)) (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_33) 4 v_DerPreprocessor_34) .cse3)) 4 v_DerPreprocessor_34) .cse3))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse25 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) |c_~#drvlist~0.offset| .cse3))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_21) .cse3 v_DerPreprocessor_22) 4 .cse25))) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_31) 4 v_DerPreprocessor_32)) (.cse22 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) 4 .cse25)) (.cse24 (select .cse21 __ldv_list_add_~next.base))) (and (= .cse3 (select v_DerPreprocessor_32 |c_~#drvlist~0.offset|)) (= (select .cse21 .cse3) (select .cse22 .cse3)) (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse3 (select .cse23 .cse3)) 4 v_DerPreprocessor_32) .cse3)) (= v_DerPreprocessor_21 .cse24) (not (= .cse3 __ldv_list_add_~next.base)) (= .cse11 (select .cse23 __ldv_list_add_~next.base)) (= (select .cse22 __ldv_list_add_~next.base) .cse24)))))) (exists ((v_DerPreprocessor_18 (Array Int Int))) (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_18) 4 .cse11) .cse3)) 4 .cse11) .cse3))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_29) 4 v_DerPreprocessor_30) .cse3)) 4 v_DerPreprocessor_30) .cse3)) (= .cse3 (select v_DerPreprocessor_30 |c_~#drvlist~0.offset|)))) (exists ((v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_16) 4 .cse11) .cse3) (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) 4 .cse11) .cse3))))))))))) (= (select |c_#valid| 4) 1) (= |c_~#drvlist~0.base| 4)) is different from true [2023-11-19 08:01:12,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:01:15,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:01:17,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:01:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:17,813 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2023-11-19 08:01:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-19 08:01:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 31 [2023-11-19 08:01:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:17,816 INFO L225 Difference]: With dead ends: 123 [2023-11-19 08:01:17,816 INFO L226 Difference]: Without dead ends: 94 [2023-11-19 08:01:17,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=349, Invalid=2395, Unknown=16, NotChecked=102, Total=2862 [2023-11-19 08:01:17,819 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 85 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 37 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:17,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 790 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 821 Invalid, 19 Unknown, 31 Unchecked, 11.2s Time] [2023-11-19 08:01:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-19 08:01:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-11-19 08:01:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.15625) internal successors, (74), 66 states have internal predecessors, (74), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 08:01:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-11-19 08:01:17,850 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2023-11-19 08:01:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:17,850 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-11-19 08:01:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 08:01:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-11-19 08:01:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 08:01:17,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:17,855 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] [2023-11-19 08:01:17,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 08:01:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9ba9b05-59c9-48ca-a71b-09601b175bc6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:18,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:18,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1764685123, now seen corresponding path program 1 times [2023-11-19 08:01:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562209978] [2023-11-19 08:01:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:18,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 08:01:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 08:01:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:18,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 08:01:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 08:01:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 08:01:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562209978] [2023-11-19 08:01:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562209978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870712945] [2023-11-19 08:01:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:18,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:18,232 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:01:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:18,421 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-19 08:01:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:01:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-11-19 08:01:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:18,425 INFO L225 Difference]: With dead ends: 89 [2023-11-19 08:01:18,425 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 08:01:18,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:18,426 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:18,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 232 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:01:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 08:01:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-19 08:01:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 69 states have internal predecessors, (77), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 08:01:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-11-19 08:01:18,468 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2023-11-19 08:01:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:18,468 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-11-19 08:01:18,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:01:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-11-19 08:01:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 08:01:18,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:18,470 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] [2023-11-19 08:01:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:01:18,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:18,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -955678868, now seen corresponding path program 1 times [2023-11-19 08:01:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64009789] [2023-11-19 08:01:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 08:01:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 08:01:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 08:01:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat