./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/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_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:43:54,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:43:54,812 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:43:54,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:43:54,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:43:54,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:43:54,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:43:54,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:43:54,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:43:54,845 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:43:54,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:43:54,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:43:54,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:43:54,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:43:54,848 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:43:54,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:43:54,849 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:43:54,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:43:54,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:43:54,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:43:54,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:43:54,852 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:43:54,852 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:43:54,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:43:54,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:43:54,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:43:54,854 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:43:54,855 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:43:54,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:43:54,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:43:54,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:43:54,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:43:54,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:43:54,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:43:54,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:43:54,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:43:54,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:43:54,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:43:54,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:43:54,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:43:54,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:43:54,859 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_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/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_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2023-11-29 05:43:55,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:43:55,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:43:55,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:43:55,132 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:43:55,133 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:43:55,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-29 05:43:57,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:43:58,145 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:43:58,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-29 05:43:58,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/data/462b51d69/3f0f674b9a9c4d0fb94c70bc303a2956/FLAG806e28c16 [2023-11-29 05:43:58,172 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/data/462b51d69/3f0f674b9a9c4d0fb94c70bc303a2956 [2023-11-29 05:43:58,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:43:58,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:43:58,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:43:58,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:43:58,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:43:58,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368b54d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58, skipping insertion in model container [2023-11-29 05:43:58,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,227 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:43:58,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:43:58,498 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:43:58,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:43:58,566 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:43:58,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58 WrapperNode [2023-11-29 05:43:58,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:43:58,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:43:58,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:43:58,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:43:58,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,614 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-11-29 05:43:58,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:43:58,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:43:58,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:43:58,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:43:58,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,648 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-11-29 05:43:58,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:43:58,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:43:58,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:43:58,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:43:58,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (1/1) ... [2023-11-29 05:43:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:43:58,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:43:58,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:43:58,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:43:58,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:43:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:43:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:43:58,747 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:43:58,748 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:43:58,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:43:58,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:43:58,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:43:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:43:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:43:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:43:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:43:58,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:43:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:43:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:43:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:43:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:43:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:43:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:43:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:43:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:43:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:43:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:43:58,880 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:43:58,882 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:43:59,183 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:43:59,223 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:43:59,224 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:43:59,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:43:59 BoogieIcfgContainer [2023-11-29 05:43:59,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:43:59,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:43:59,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:43:59,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:43:59,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:43:58" (1/3) ... [2023-11-29 05:43:59,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76869c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:43:59, skipping insertion in model container [2023-11-29 05:43:59,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:58" (2/3) ... [2023-11-29 05:43:59,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76869c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:43:59, skipping insertion in model container [2023-11-29 05:43:59,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:43:59" (3/3) ... [2023-11-29 05:43:59,234 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-11-29 05:43:59,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:43:59,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-29 05:43:59,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:43:59,334 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2029b99d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:43:59,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-29 05:43:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:43:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:43:59,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:59,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:43:59,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:43:59,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 181913967, now seen corresponding path program 1 times [2023-11-29 05:43:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:43:59,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003403638] [2023-11-29 05:43:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:43:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:59,579 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 05:43:59,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:43:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003403638] [2023-11-29 05:43:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003403638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:59,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:43:59,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986540350] [2023-11-29 05:43:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:59,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:43:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:59,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:43:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:43:59,622 INFO L87 Difference]: Start difference. First operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:43:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:59,750 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-29 05:43:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:43:59,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:43:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:59,762 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:43:59,762 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 05:43:59,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:43:59,768 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:59,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 111 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:43:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 05:43:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 05:43:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 2.128205128205128) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:43:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2023-11-29 05:43:59,812 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2023-11-29 05:43:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:59,813 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2023-11-29 05:43:59,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:43:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2023-11-29 05:43:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:43:59,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:59,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:43:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:43:59,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:43:59,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash 181913968, now seen corresponding path program 1 times [2023-11-29 05:43:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:43:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454353498] [2023-11-29 05:43:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:43:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:59,944 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 05:43:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:43:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454353498] [2023-11-29 05:43:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454353498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:43:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256118062] [2023-11-29 05:43:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:43:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:59,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:43:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:43:59,948 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:00,041 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-29 05:44:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:44:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:00,043 INFO L225 Difference]: With dead ends: 80 [2023-11-29 05:44:00,043 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 05:44:00,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:00,045 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:00,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 05:44:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 05:44:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.051282051282051) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-29 05:44:00,057 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2023-11-29 05:44:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:00,058 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-29 05:44:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-29 05:44:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:44:00,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:00,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:00,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:44:00,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:00,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -956323543, now seen corresponding path program 1 times [2023-11-29 05:44:00,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:00,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154881575] [2023-11-29 05:44:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,289 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 05:44:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154881575] [2023-11-29 05:44:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154881575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463650565] [2023-11-29 05:44:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:00,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:00,294 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-29 05:44:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:00,561 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-29 05:44:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-11-29 05:44:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:00,565 INFO L225 Difference]: With dead ends: 84 [2023-11-29 05:44:00,565 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 05:44:00,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:00,567 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:00,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 05:44:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-11-29 05:44:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.048780487804878) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 05:44:00,578 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 11 [2023-11-29 05:44:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 05:44:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-29 05:44:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 05:44:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:44:00,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:00,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:00,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:44:00,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:00,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -956323542, now seen corresponding path program 1 times [2023-11-29 05:44:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136848158] [2023-11-29 05:44:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,681 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 05:44:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136848158] [2023-11-29 05:44:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136848158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:00,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:44:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776801257] [2023-11-29 05:44:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:00,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:00,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:00,685 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-29 05:44:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:00,799 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-29 05:44:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2023-11-29 05:44:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:00,801 INFO L225 Difference]: With dead ends: 81 [2023-11-29 05:44:00,801 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 05:44:00,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:00,803 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:00,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 05:44:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-29 05:44:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 40 states have (on average 2.025) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-11-29 05:44:00,811 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2023-11-29 05:44:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:00,811 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-11-29 05:44:00,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-29 05:44:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-11-29 05:44:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:44:00,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:00,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:44:00,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:00,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -422303523, now seen corresponding path program 1 times [2023-11-29 05:44:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943851898] [2023-11-29 05:44:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:44:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943851898] [2023-11-29 05:44:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943851898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:01,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:01,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072161479] [2023-11-29 05:44:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:01,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:01,032 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:01,270 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-29 05:44:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:01,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 05:44:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:01,271 INFO L225 Difference]: With dead ends: 80 [2023-11-29 05:44:01,272 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 05:44:01,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:01,273 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:01,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 220 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 05:44:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 05:44:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.0) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-29 05:44:01,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2023-11-29 05:44:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:01,282 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-29 05:44:01,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-29 05:44:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:44:01,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:01,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:01,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:44:01,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:01,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -422303522, now seen corresponding path program 1 times [2023-11-29 05:44:01,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:01,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141432194] [2023-11-29 05:44:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141432194] [2023-11-29 05:44:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141432194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:01,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899990804] [2023-11-29 05:44:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:01,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:01,566 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:01,772 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-11-29 05:44:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 05:44:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:01,773 INFO L225 Difference]: With dead ends: 79 [2023-11-29 05:44:01,774 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:44:01,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:01,775 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:01,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:44:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 05:44:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.975) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-29 05:44:01,781 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 19 [2023-11-29 05:44:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:01,782 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-29 05:44:01,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-29 05:44:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:44:01,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:01,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:01,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:44:01,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:01,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760066, now seen corresponding path program 1 times [2023-11-29 05:44:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659959356] [2023-11-29 05:44:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659959356] [2023-11-29 05:44:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659959356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195605960] [2023-11-29 05:44:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:02,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:02,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:02,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:44:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:02,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:44:02,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:02,317 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 6 treesize of output 5 [2023-11-29 05:44:02,370 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 05:44:02,432 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:44:02,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 05:44:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-29 05:44:02,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195605960] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:02,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:44:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-29 05:44:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599952331] [2023-11-29 05:44:02,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:02,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-29 05:44:02,513 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:02,830 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-29 05:44:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-11-29 05:44:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:02,832 INFO L225 Difference]: With dead ends: 86 [2023-11-29 05:44:02,832 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:44:02,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-29 05:44:02,833 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:02,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2023-11-29 05:44:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:44:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-11-29 05:44:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-11-29 05:44:02,841 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 21 [2023-11-29 05:44:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:02,841 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-11-29 05:44:02,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-11-29 05:44:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:44:02,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:02,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:02,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:44:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:03,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:03,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760065, now seen corresponding path program 1 times [2023-11-29 05:44:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915904869] [2023-11-29 05:44:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:03,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915904869] [2023-11-29 05:44:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915904869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676999555] [2023-11-29 05:44:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:03,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:03,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:44:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:03,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 05:44:03,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:03,665 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 1 [2023-11-29 05:44:03,672 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 6 treesize of output 5 [2023-11-29 05:44:03,873 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:44:03,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 05:44:03,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:44:03,894 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-29 05:44:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:03,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676999555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:04,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:44:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-29 05:44:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145971018] [2023-11-29 05:44:04,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:04,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:44:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:44:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:44:04,100 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:04,558 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-29 05:44:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:44:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-29 05:44:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:04,559 INFO L225 Difference]: With dead ends: 86 [2023-11-29 05:44:04,560 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:44:04,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:44:04,561 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:04,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:44:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:44:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-11-29 05:44:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 05:44:04,567 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 21 [2023-11-29 05:44:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:04,568 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 05:44:04,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 05:44:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:44:04,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:04,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:04,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:44:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:04,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:04,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1666672876, now seen corresponding path program 1 times [2023-11-29 05:44:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:04,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960048085] [2023-11-29 05:44:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:04,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960048085] [2023-11-29 05:44:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960048085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051866308] [2023-11-29 05:44:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:04,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:04,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:04,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:44:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:05,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:44:05,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:05,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051866308] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:05,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-29 05:44:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802118235] [2023-11-29 05:44:05,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:05,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:05,131 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:05,274 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-29 05:44:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 05:44:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:05,275 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:44:05,276 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:44:05,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:05,276 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:05,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 338 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:44:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-29 05:44:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-29 05:44:05,282 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 23 [2023-11-29 05:44:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:05,282 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-29 05:44:05,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-29 05:44:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:44:05,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:05,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:05,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:44:05,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:05,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:05,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash -132032267, now seen corresponding path program 1 times [2023-11-29 05:44:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557439834] [2023-11-29 05:44:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557439834] [2023-11-29 05:44:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557439834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518263180] [2023-11-29 05:44:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:05,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:05,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:44:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:05,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:44:05,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:05,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:05,818 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 05:44:05,819 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 12 treesize of output 11 [2023-11-29 05:44:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518263180] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:05,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-29 05:44:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637001945] [2023-11-29 05:44:05,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:05,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:05,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:05,839 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:06,040 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-29 05:44:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 05:44:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:06,042 INFO L225 Difference]: With dead ends: 89 [2023-11-29 05:44:06,042 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 05:44:06,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:06,043 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:06,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 220 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 05:44:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-11-29 05:44:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.872340425531915) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-11-29 05:44:06,049 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 24 [2023-11-29 05:44:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:06,050 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-11-29 05:44:06,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-11-29 05:44:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:44:06,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:06,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:06,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:44:06,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:06,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:06,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -132032266, now seen corresponding path program 1 times [2023-11-29 05:44:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:06,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418396905] [2023-11-29 05:44:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418396905] [2023-11-29 05:44:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418396905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386973373] [2023-11-29 05:44:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:06,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:06,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:44:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:06,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:44:06,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:06,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:06,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:44:06,842 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 19 treesize of output 23 [2023-11-29 05:44:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386973373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:06,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-29 05:44:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757271471] [2023-11-29 05:44:06,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:06,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:44:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:44:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:44:06,997 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:44:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:07,274 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-11-29 05:44:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:44:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-29 05:44:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:07,276 INFO L225 Difference]: With dead ends: 91 [2023-11-29 05:44:07,276 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 05:44:07,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:44:07,277 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:07,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 581 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 05:44:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-29 05:44:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.851063829787234) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-11-29 05:44:07,283 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 24 [2023-11-29 05:44:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:07,283 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-11-29 05:44:07,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:44:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-11-29 05:44:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:44:07,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:07,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:07,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:44:07,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:44:07,491 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:07,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 201967024, now seen corresponding path program 1 times [2023-11-29 05:44:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494725790] [2023-11-29 05:44:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:44:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494725790] [2023-11-29 05:44:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494725790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:44:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124611715] [2023-11-29 05:44:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:07,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:44:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:07,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:44:07,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:07,655 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:07,887 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-11-29 05:44:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:44:07,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 05:44:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:07,889 INFO L225 Difference]: With dead ends: 87 [2023-11-29 05:44:07,889 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:44:07,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:44:07,890 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:07,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:44:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-29 05:44:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-11-29 05:44:07,894 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 25 [2023-11-29 05:44:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:07,894 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-11-29 05:44:07,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-11-29 05:44:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:44:07,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:07,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:07,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:44:07,896 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:07,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash 201967025, now seen corresponding path program 1 times [2023-11-29 05:44:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203865798] [2023-11-29 05:44:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203865798] [2023-11-29 05:44:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203865798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:44:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448756876] [2023-11-29 05:44:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:08,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:44:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:44:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:44:08,152 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:08,371 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-11-29 05:44:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:44:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 05:44:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:08,372 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:44:08,372 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:44:08,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:44:08,373 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:08,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:44:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 05:44:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-11-29 05:44:08,377 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 25 [2023-11-29 05:44:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:08,377 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-11-29 05:44:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-11-29 05:44:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:44:08,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:08,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:44:08,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:08,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 816901485, now seen corresponding path program 1 times [2023-11-29 05:44:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053815238] [2023-11-29 05:44:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:44:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053815238] [2023-11-29 05:44:08,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053815238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505009138] [2023-11-29 05:44:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:08,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:08,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:08,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:44:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:08,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:44:08,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:08,957 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 6 treesize of output 5 [2023-11-29 05:44:09,007 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from false [2023-11-29 05:44:09,010 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from true [2023-11-29 05:44:09,033 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2023-11-29 05:44:09,036 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2023-11-29 05:44:09,154 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))))))) is different from false [2023-11-29 05:44:09,160 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))))))) is different from true [2023-11-29 05:44:09,249 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2023-11-29 05:44:09,255 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2023-11-29 05:44:09,364 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1))) is different from false [2023-11-29 05:44:09,371 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1))) is different from true [2023-11-29 05:44:09,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from false [2023-11-29 05:44:09,671 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from true [2023-11-29 05:44:09,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from false [2023-11-29 05:44:09,806 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from true [2023-11-29 05:44:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-11-29 05:44:09,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505009138] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:10,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 25 [2023-11-29 05:44:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857260699] [2023-11-29 05:44:10,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:10,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 05:44:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:44:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=294, Unknown=14, NotChecked=294, Total=702 [2023-11-29 05:44:10,300 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:44:10,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from false [2023-11-29 05:44:10,383 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from true [2023-11-29 05:44:10,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2023-11-29 05:44:10,390 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2023-11-29 05:44:10,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-29 05:44:10,426 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-29 05:44:10,449 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2023-11-29 05:44:10,454 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2023-11-29 05:44:10,480 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse1 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2))) (or .cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-29 05:44:10,484 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse1 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2))) (or .cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-29 05:44:10,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from false [2023-11-29 05:44:10,504 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from true [2023-11-29 05:44:10,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 .cse2 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse2)) is different from false [2023-11-29 05:44:10,545 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 .cse2 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse2)) is different from true [2023-11-29 05:44:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:10,916 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-11-29 05:44:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:44:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-11-29 05:44:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:10,918 INFO L225 Difference]: With dead ends: 119 [2023-11-29 05:44:10,918 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 05:44:10,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=356, Unknown=28, NotChecked=742, Total=1260 [2023-11-29 05:44:10,920 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 167 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1190 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:10,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 352 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 569 Invalid, 0 Unknown, 1190 Unchecked, 0.4s Time] [2023-11-29 05:44:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 05:44:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2023-11-29 05:44:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.8) internal successors, (99), 86 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2023-11-29 05:44:10,923 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 27 [2023-11-29 05:44:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2023-11-29 05:44:10,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:44:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2023-11-29 05:44:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:44:10,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:10,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:10,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:44:11,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 05:44:11,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:11,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash 816901486, now seen corresponding path program 1 times [2023-11-29 05:44:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:11,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017363126] [2023-11-29 05:44:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017363126] [2023-11-29 05:44:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017363126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052557791] [2023-11-29 05:44:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:11,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:11,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:11,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:11,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:44:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:11,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 05:44:11,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:11,888 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 1 [2023-11-29 05:44:11,916 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-29 05:44:11,939 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-29 05:44:11,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:44:12,004 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-29 05:44:12,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:12,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:44:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:12,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052557791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:12,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:44:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2023-11-29 05:44:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720331611] [2023-11-29 05:44:12,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:12,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:44:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:44:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-11-29 05:44:12,279 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:44:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:12,578 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2023-11-29 05:44:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-11-29 05:44:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:12,580 INFO L225 Difference]: With dead ends: 84 [2023-11-29 05:44:12,580 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 05:44:12,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2023-11-29 05:44:12,581 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 232 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:12,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 111 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2023-11-29 05:44:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 05:44:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 05:44:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2023-11-29 05:44:12,586 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 27 [2023-11-29 05:44:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:12,586 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2023-11-29 05:44:12,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:44:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2023-11-29 05:44:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:44:12,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:12,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:12,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:44:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:44:12,788 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:12,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 816901481, now seen corresponding path program 1 times [2023-11-29 05:44:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140468694] [2023-11-29 05:44:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140468694] [2023-11-29 05:44:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140468694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:44:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153410651] [2023-11-29 05:44:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:12,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:44:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:12,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:44:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:12,906 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:12,991 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-29 05:44:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:44:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-11-29 05:44:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:12,993 INFO L225 Difference]: With dead ends: 116 [2023-11-29 05:44:12,993 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 05:44:12,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:12,994 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 123 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:12,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 137 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 05:44:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2023-11-29 05:44:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-11-29 05:44:12,998 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 27 [2023-11-29 05:44:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:12,998 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-11-29 05:44:12,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-11-29 05:44:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:44:12,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:12,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:12,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:44:13,000 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:13,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -445857719, now seen corresponding path program 1 times [2023-11-29 05:44:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88822267] [2023-11-29 05:44:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:44:13,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88822267] [2023-11-29 05:44:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88822267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:13,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:13,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6937041] [2023-11-29 05:44:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:13,289 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:13,612 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2023-11-29 05:44:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:44:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-29 05:44:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:13,613 INFO L225 Difference]: With dead ends: 104 [2023-11-29 05:44:13,613 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 05:44:13,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:44:13,614 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:13,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 262 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:44:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 05:44:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2023-11-29 05:44:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-29 05:44:13,619 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 28 [2023-11-29 05:44:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:13,619 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-29 05:44:13,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-29 05:44:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:44:13,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:13,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:13,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:44:13,621 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:13,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -445857718, now seen corresponding path program 1 times [2023-11-29 05:44:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015239865] [2023-11-29 05:44:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:14,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015239865] [2023-11-29 05:44:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015239865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140586053] [2023-11-29 05:44:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:14,036 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:14,364 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2023-11-29 05:44:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:44:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-29 05:44:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:14,366 INFO L225 Difference]: With dead ends: 125 [2023-11-29 05:44:14,366 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 05:44:14,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:44:14,367 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:14,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 355 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:44:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 05:44:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2023-11-29 05:44:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-29 05:44:14,371 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 28 [2023-11-29 05:44:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:14,372 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-29 05:44:14,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-29 05:44:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:44:14,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:14,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:14,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:44:14,373 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:14,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -936683965, now seen corresponding path program 1 times [2023-11-29 05:44:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357410401] [2023-11-29 05:44:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357410401] [2023-11-29 05:44:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357410401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497860409] [2023-11-29 05:44:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:14,448 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:14,529 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2023-11-29 05:44:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-29 05:44:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:14,531 INFO L225 Difference]: With dead ends: 97 [2023-11-29 05:44:14,531 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 05:44:14,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:14,532 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:14,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 90 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 05:44:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-29 05:44:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.65625) internal successors, (106), 87 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2023-11-29 05:44:14,536 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 29 [2023-11-29 05:44:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2023-11-29 05:44:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2023-11-29 05:44:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:44:14,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:14,538 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:14,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:44:14,538 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:14,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843236, now seen corresponding path program 1 times [2023-11-29 05:44:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:14,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707166141] [2023-11-29 05:44:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707166141] [2023-11-29 05:44:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707166141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:14,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:44:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912267871] [2023-11-29 05:44:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:14,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:44:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:14,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:44:14,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:44:15,000 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:15,414 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2023-11-29 05:44:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:44:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-11-29 05:44:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:15,416 INFO L225 Difference]: With dead ends: 107 [2023-11-29 05:44:15,416 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 05:44:15,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:44:15,417 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:15,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 364 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:44:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 05:44:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2023-11-29 05:44:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.626865671641791) internal successors, (109), 89 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2023-11-29 05:44:15,422 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 31 [2023-11-29 05:44:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:15,422 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2023-11-29 05:44:15,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2023-11-29 05:44:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:44:15,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:15,423 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:44:15,424 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:15,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843237, now seen corresponding path program 1 times [2023-11-29 05:44:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602512667] [2023-11-29 05:44:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602512667] [2023-11-29 05:44:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602512667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66569854] [2023-11-29 05:44:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:16,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:16,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:16,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:44:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:16,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:44:16,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:16,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 1 [2023-11-29 05:44:16,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2023-11-29 05:44:16,950 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 32 treesize of output 20 [2023-11-29 05:44:17,009 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 17 treesize of output 9 [2023-11-29 05:44:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:17,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:17,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:17,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:17,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:17,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:17,248 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 8 treesize of output 4 [2023-11-29 05:44:17,252 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 8 treesize of output 4 [2023-11-29 05:44:17,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:44:17,392 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 15 treesize of output 19 [2023-11-29 05:44:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:17,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66569854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:17,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 35 [2023-11-29 05:44:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403060775] [2023-11-29 05:44:17,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:17,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 05:44:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 05:44:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 05:44:17,591 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:18,478 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2023-11-29 05:44:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:44:18,478 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-11-29 05:44:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:18,479 INFO L225 Difference]: With dead ends: 127 [2023-11-29 05:44:18,480 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 05:44:18,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 05:44:18,482 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 220 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:18,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 626 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:44:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 05:44:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2023-11-29 05:44:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 97 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2023-11-29 05:44:18,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 31 [2023-11-29 05:44:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:18,487 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2023-11-29 05:44:18,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2023-11-29 05:44:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:44:18,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:18,488 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:18,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:44:18,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:18,688 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:18,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -349448386, now seen corresponding path program 1 times [2023-11-29 05:44:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:18,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118631831] [2023-11-29 05:44:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118631831] [2023-11-29 05:44:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118631831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699126323] [2023-11-29 05:44:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:18,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:18,926 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:19,148 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2023-11-29 05:44:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:44:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-29 05:44:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:19,150 INFO L225 Difference]: With dead ends: 101 [2023-11-29 05:44:19,150 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 05:44:19,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:44:19,151 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 86 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:19,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 295 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 05:44:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 05:44:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.56) internal successors, (117), 96 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2023-11-29 05:44:19,155 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 32 [2023-11-29 05:44:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:19,155 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2023-11-29 05:44:19,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2023-11-29 05:44:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:44:19,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:19,156 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:19,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:44:19,156 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:19,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2052509908, now seen corresponding path program 1 times [2023-11-29 05:44:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214236796] [2023-11-29 05:44:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214236796] [2023-11-29 05:44:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214236796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775092318] [2023-11-29 05:44:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:19,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:19,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:44:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:19,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:44:19,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:20,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 1 [2023-11-29 05:44:20,110 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 27 treesize of output 19 [2023-11-29 05:44:20,112 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 23 treesize of output 15 [2023-11-29 05:44:20,137 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 21 treesize of output 9 [2023-11-29 05:44:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:44:20,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:20,230 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 31 treesize of output 23 [2023-11-29 05:44:20,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:20,235 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 8 treesize of output 4 [2023-11-29 05:44:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:44:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775092318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:20,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 23 [2023-11-29 05:44:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394394715] [2023-11-29 05:44:20,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:20,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 05:44:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:44:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:44:20,314 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:44:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:21,018 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2023-11-29 05:44:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:44:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-11-29 05:44:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:21,020 INFO L225 Difference]: With dead ends: 120 [2023-11-29 05:44:21,020 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 05:44:21,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 05:44:21,021 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 182 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:21,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 561 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:44:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 05:44:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-11-29 05:44:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 98 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2023-11-29 05:44:21,026 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 33 [2023-11-29 05:44:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:21,026 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2023-11-29 05:44:21,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:44:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2023-11-29 05:44:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:44:21,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:21,027 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:21,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:44:21,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:21,228 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:21,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2052002020, now seen corresponding path program 1 times [2023-11-29 05:44:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427076179] [2023-11-29 05:44:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427076179] [2023-11-29 05:44:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427076179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220054031] [2023-11-29 05:44:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:21,458 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:21,803 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2023-11-29 05:44:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:44:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 05:44:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:21,804 INFO L225 Difference]: With dead ends: 127 [2023-11-29 05:44:21,804 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 05:44:21,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:44:21,805 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 81 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:21,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 347 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:44:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 05:44:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2023-11-29 05:44:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5375) internal successors, (123), 101 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:44:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-11-29 05:44:21,809 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 33 [2023-11-29 05:44:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:21,809 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-11-29 05:44:21,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-11-29 05:44:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:44:21,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:21,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:21,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:44:21,810 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:21,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2059322698, now seen corresponding path program 1 times [2023-11-29 05:44:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147069603] [2023-11-29 05:44:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:44:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:44:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147069603] [2023-11-29 05:44:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147069603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:21,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:21,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:44:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955141987] [2023-11-29 05:44:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:21,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:44:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:44:21,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:21,924 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:21,986 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-11-29 05:44:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:44:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-29 05:44:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:21,988 INFO L225 Difference]: With dead ends: 86 [2023-11-29 05:44:21,988 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:44:21,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:21,988 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:21,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:44:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 05:44:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-29 05:44:21,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 34 [2023-11-29 05:44:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:21,992 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-29 05:44:21,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:44:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-29 05:44:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:44:21,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:21,994 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:21,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:44:21,994 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:21,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -812446720, now seen corresponding path program 1 times [2023-11-29 05:44:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:21,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788988156] [2023-11-29 05:44:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788988156] [2023-11-29 05:44:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788988156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:44:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126737954] [2023-11-29 05:44:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:22,100 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:22,201 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2023-11-29 05:44:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:22,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-11-29 05:44:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:22,202 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:44:22,202 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:44:22,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:22,203 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:22,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:44:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 05:44:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 81 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-11-29 05:44:22,207 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 34 [2023-11-29 05:44:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:22,207 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-11-29 05:44:22,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-11-29 05:44:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:44:22,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:22,208 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:22,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:44:22,209 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:22,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1072036407, now seen corresponding path program 1 times [2023-11-29 05:44:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019467521] [2023-11-29 05:44:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019467521] [2023-11-29 05:44:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019467521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:22,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:44:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39796929] [2023-11-29 05:44:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:22,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:44:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:22,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:44:22,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:44:22,387 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:22,536 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-11-29 05:44:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-29 05:44:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:22,537 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:44:22,537 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:44:22,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:44:22,538 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:22,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:44:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-29 05:44:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 80 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2023-11-29 05:44:22,541 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 35 [2023-11-29 05:44:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:22,542 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2023-11-29 05:44:22,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2023-11-29 05:44:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:44:22,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:22,543 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:22,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:44:22,543 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:22,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 583955559, now seen corresponding path program 1 times [2023-11-29 05:44:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331613261] [2023-11-29 05:44:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:22,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331613261] [2023-11-29 05:44:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331613261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078396085] [2023-11-29 05:44:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:22,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:22,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:44:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:23,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:44:23,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:23,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:23,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:44:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:23,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078396085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:44:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2023-11-29 05:44:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939951270] [2023-11-29 05:44:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:44:23,255 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:23,368 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-11-29 05:44:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-29 05:44:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:23,370 INFO L225 Difference]: With dead ends: 83 [2023-11-29 05:44:23,370 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 05:44:23,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:44:23,371 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:23,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 73 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 05:44:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 05:44:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2023-11-29 05:44:23,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 35 [2023-11-29 05:44:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:23,374 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2023-11-29 05:44:23,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2023-11-29 05:44:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:44:23,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:23,375 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:23,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:44:23,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 05:44:23,576 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:23,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609692, now seen corresponding path program 1 times [2023-11-29 05:44:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265676691] [2023-11-29 05:44:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265676691] [2023-11-29 05:44:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265676691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 05:44:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403928400] [2023-11-29 05:44:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:24,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:44:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:44:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:44:24,070 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:24,527 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2023-11-29 05:44:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:44:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-29 05:44:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:24,528 INFO L225 Difference]: With dead ends: 96 [2023-11-29 05:44:24,528 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 05:44:24,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:44:24,529 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:24,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 253 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:44:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 05:44:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2023-11-29 05:44:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-29 05:44:24,532 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 36 [2023-11-29 05:44:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:24,533 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-29 05:44:24,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-29 05:44:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:44:24,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:24,533 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:24,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:44:24,534 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:24,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609691, now seen corresponding path program 1 times [2023-11-29 05:44:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918629531] [2023-11-29 05:44:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918629531] [2023-11-29 05:44:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918629531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:24,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:44:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646078869] [2023-11-29 05:44:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:24,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:44:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:44:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:44:24,921 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:25,211 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-11-29 05:44:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:44:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-29 05:44:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:25,212 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:44:25,212 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 05:44:25,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:44:25,213 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:25,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 335 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 05:44:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-29 05:44:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2023-11-29 05:44:25,216 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2023-11-29 05:44:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:25,217 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2023-11-29 05:44:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2023-11-29 05:44:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:44:25,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:25,217 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:25,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:44:25,218 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:25,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash -340088053, now seen corresponding path program 1 times [2023-11-29 05:44:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282747021] [2023-11-29 05:44:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282747021] [2023-11-29 05:44:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282747021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069428990] [2023-11-29 05:44:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:26,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:26,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:44:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:26,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 05:44:26,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:26,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:44:26,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:44:26,569 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2023-11-29 05:44:26,569 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 2 case distinctions, treesize of input 66 treesize of output 45 [2023-11-29 05:44:26,783 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 7 treesize of output 3 [2023-11-29 05:44:26,935 INFO L349 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-11-29 05:44:26,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 52 [2023-11-29 05:44:27,032 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 15 treesize of output 7 [2023-11-29 05:44:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:27,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:27,045 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 05:44:27,046 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 12 treesize of output 11 [2023-11-29 05:44:27,285 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 54 treesize of output 42 [2023-11-29 05:44:27,286 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 41 treesize of output 33 [2023-11-29 05:44:27,449 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 228 treesize of output 220 [2023-11-29 05:44:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069428990] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:27,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 51 [2023-11-29 05:44:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218698160] [2023-11-29 05:44:27,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:27,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 05:44:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 05:44:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2435, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 05:44:27,828 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:29,065 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2023-11-29 05:44:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:44:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-11-29 05:44:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:29,066 INFO L225 Difference]: With dead ends: 95 [2023-11-29 05:44:29,066 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 05:44:29,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=431, Invalid=3859, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 05:44:29,069 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 139 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:29,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 739 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:44:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 05:44:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2023-11-29 05:44:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 84 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-11-29 05:44:29,072 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 38 [2023-11-29 05:44:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:29,073 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-11-29 05:44:29,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-11-29 05:44:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:44:29,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:29,074 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:29,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:44:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:29,274 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:29,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -340088052, now seen corresponding path program 1 times [2023-11-29 05:44:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521669191] [2023-11-29 05:44:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521669191] [2023-11-29 05:44:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521669191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148021832] [2023-11-29 05:44:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:31,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:31,100 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:31,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:44:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:31,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 05:44:31,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:31,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:44:31,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:44:31,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-29 05:44:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:44:31,832 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:44:31,832 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2023-11-29 05:44:31,845 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2023-11-29 05:44:31,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-11-29 05:44:32,202 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 113 treesize of output 69 [2023-11-29 05:44:32,655 INFO L349 Elim1Store]: treesize reduction 52, result has 74.9 percent of original size [2023-11-29 05:44:32,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 166 treesize of output 251 [2023-11-29 05:44:32,728 INFO L349 Elim1Store]: treesize reduction 16, result has 76.8 percent of original size [2023-11-29 05:44:32,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 124 [2023-11-29 05:44:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:44:40,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:41,069 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 153 treesize of output 129 [2023-11-29 05:44:41,073 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 113 treesize of output 93 [2023-11-29 05:44:41,467 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-11-29 05:44:41,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 103 [2023-11-29 05:44:41,476 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 438 treesize of output 430 [2023-11-29 05:44:41,516 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2023-11-29 05:44:41,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 484 treesize of output 445 [2023-11-29 05:44:41,538 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 282 treesize of output 258 [2023-11-29 05:44:42,084 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-11-29 05:44:42,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-29 05:44:42,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:44:42,098 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-11-29 05:44:42,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2023-11-29 05:44:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-29 05:44:42,535 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 17 treesize of output 13 [2023-11-29 05:44:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148021832] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:42,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:42,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 59 [2023-11-29 05:44:42,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289301166] [2023-11-29 05:44:42,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-29 05:44:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-29 05:44:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3327, Unknown=0, NotChecked=0, Total=3540 [2023-11-29 05:44:42,713 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 60 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 53 states have internal predecessors, (92), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:46,350 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2023-11-29 05:44:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:44:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 53 states have internal predecessors, (92), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-11-29 05:44:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:46,351 INFO L225 Difference]: With dead ends: 95 [2023-11-29 05:44:46,351 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 05:44:46,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=506, Invalid=6136, Unknown=0, NotChecked=0, Total=6642 [2023-11-29 05:44:46,354 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 176 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:46,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 725 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:44:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 05:44:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2023-11-29 05:44:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.4) internal successors, (98), 84 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2023-11-29 05:44:46,357 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 38 [2023-11-29 05:44:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:46,357 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2023-11-29 05:44:46,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 53 states have internal predecessors, (92), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2023-11-29 05:44:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:44:46,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:46,358 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:46,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:44:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:46,558 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:46,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2002632954, now seen corresponding path program 1 times [2023-11-29 05:44:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:46,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878142874] [2023-11-29 05:44:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:46,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878142874] [2023-11-29 05:44:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878142874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951867794] [2023-11-29 05:44:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:46,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:46,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:46,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:46,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:44:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:46,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:44:46,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:46,923 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 6 treesize of output 5 [2023-11-29 05:44:46,938 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-29 05:44:46,950 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 05:44:46,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:46,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:44:46,987 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-29 05:44:46,992 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-29 05:44:47,012 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 05:44:47,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 05:44:47,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:47,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:44:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2023-11-29 05:44:47,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:50,264 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3936 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| Int) (|v_node_create_~temp~0#1.base_85| Int)) (or (= (select (store (store |c_#valid| |v_node_create_~temp~0#1.base_85| 1) |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| v_ArrVal_3936) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| 1)))) is different from false [2023-11-29 05:44:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951867794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:50,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:44:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2023-11-29 05:44:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968731951] [2023-11-29 05:44:50,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:50,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2023-11-29 05:44:50,268 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:50,284 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 05:44:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:50,424 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-11-29 05:44:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:44:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-29 05:44:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:50,425 INFO L225 Difference]: With dead ends: 116 [2023-11-29 05:44:50,425 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 05:44:50,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=58, Invalid=136, Unknown=4, NotChecked=108, Total=306 [2023-11-29 05:44:50,426 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 128 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:50,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 105 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 209 Unchecked, 0.1s Time] [2023-11-29 05:44:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 05:44:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2023-11-29 05:44:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 82 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2023-11-29 05:44:50,435 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 38 [2023-11-29 05:44:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:50,435 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2023-11-29 05:44:50,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2023-11-29 05:44:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:44:50,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:50,435 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:50,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:44:50,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-29 05:44:50,636 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:50,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1952079452, now seen corresponding path program 1 times [2023-11-29 05:44:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357577804] [2023-11-29 05:44:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357577804] [2023-11-29 05:44:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357577804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211136623] [2023-11-29 05:44:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:51,292 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:51,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:44:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:51,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 05:44:51,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:51,579 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 6 treesize of output 5 [2023-11-29 05:44:51,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:44:51,744 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-29 05:44:51,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 1 [2023-11-29 05:44:52,032 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2023-11-29 05:44:52,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2023-11-29 05:44:52,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 05:44:52,144 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 16 treesize of output 8 [2023-11-29 05:44:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:52,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:52,253 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 8 treesize of output 4 [2023-11-29 05:44:52,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:52,287 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 34 treesize of output 26 [2023-11-29 05:44:52,288 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 35 treesize of output 23 [2023-11-29 05:44:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211136623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:52,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 48 [2023-11-29 05:44:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11639973] [2023-11-29 05:44:52,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:52,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 05:44:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 05:44:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2113, Unknown=0, NotChecked=0, Total=2256 [2023-11-29 05:44:52,668 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 48 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 39 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:53,872 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2023-11-29 05:44:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:44:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 39 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2023-11-29 05:44:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:53,874 INFO L225 Difference]: With dead ends: 89 [2023-11-29 05:44:53,874 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:44:53,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=3477, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 05:44:53,875 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:53,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 685 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:44:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:44:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-29 05:44:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 82 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-11-29 05:44:53,878 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 39 [2023-11-29 05:44:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-29 05:44:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 39 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:44:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2023-11-29 05:44:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 05:44:53,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:53,878 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:53,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:44:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 05:44:54,079 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:54,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -322403520, now seen corresponding path program 1 times [2023-11-29 05:44:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339848132] [2023-11-29 05:44:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339848132] [2023-11-29 05:44:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339848132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047248853] [2023-11-29 05:44:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:54,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:54,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:54,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:54,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:44:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:54,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:44:54,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:54,614 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 17 treesize of output 9 [2023-11-29 05:44:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:54,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:54,633 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-29 05:44:54,633 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 16 treesize of output 15 [2023-11-29 05:44:54,680 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:44:54,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-29 05:44:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047248853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:54,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-11-29 05:44:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737466954] [2023-11-29 05:44:54,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:54,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:44:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:44:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:44:54,692 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:54,910 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2023-11-29 05:44:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:44:54,911 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-11-29 05:44:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:54,912 INFO L225 Difference]: With dead ends: 111 [2023-11-29 05:44:54,912 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 05:44:54,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:44:54,913 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 165 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:54,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 258 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 05:44:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2023-11-29 05:44:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.337837837837838) internal successors, (99), 86 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2023-11-29 05:44:54,916 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 42 [2023-11-29 05:44:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:54,916 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2023-11-29 05:44:54,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:44:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2023-11-29 05:44:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 05:44:54,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:54,917 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:54,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:44:55,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 05:44:55,117 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:55,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1404576354, now seen corresponding path program 1 times [2023-11-29 05:44:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968263215] [2023-11-29 05:44:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:44:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968263215] [2023-11-29 05:44:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968263215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342747162] [2023-11-29 05:44:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:55,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:44:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:44:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:44:55,265 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:55,447 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2023-11-29 05:44:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:44:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2023-11-29 05:44:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:55,449 INFO L225 Difference]: With dead ends: 104 [2023-11-29 05:44:55,449 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 05:44:55,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:44:55,449 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:55,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 267 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:44:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 05:44:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-11-29 05:44:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-11-29 05:44:55,452 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 43 [2023-11-29 05:44:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:55,453 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-11-29 05:44:55,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-11-29 05:44:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:44:55,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:55,453 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:44:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:44:55,454 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:55,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -592146989, now seen corresponding path program 1 times [2023-11-29 05:44:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75106539] [2023-11-29 05:44:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75106539] [2023-11-29 05:44:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75106539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633379465] [2023-11-29 05:44:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:55,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:55,571 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:55,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:44:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:55,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:55,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:55,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:44:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633379465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:55,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 05:44:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629425609] [2023-11-29 05:44:55,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:44:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:44:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:44:55,939 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:56,016 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-11-29 05:44:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:56,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-29 05:44:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:56,018 INFO L225 Difference]: With dead ends: 120 [2023-11-29 05:44:56,018 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 05:44:56,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:44:56,018 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 146 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:56,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 184 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 05:44:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2023-11-29 05:44:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 90 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:44:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2023-11-29 05:44:56,022 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 44 [2023-11-29 05:44:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:56,022 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2023-11-29 05:44:56,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:44:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2023-11-29 05:44:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:44:56,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:56,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:56,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:44:56,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 05:44:56,223 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:44:56,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1173087027, now seen corresponding path program 1 times [2023-11-29 05:44:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682450701] [2023-11-29 05:44:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:44:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:44:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:44:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682450701] [2023-11-29 05:44:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682450701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107344686] [2023-11-29 05:44:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:57,159 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:57,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:44:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 05:44:57,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:57,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:44:57,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:44:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:44:57,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:44:57,750 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:44:57,750 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2023-11-29 05:44:57,766 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2023-11-29 05:44:57,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-11-29 05:44:58,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:44:58,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:44:58,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 45 [2023-11-29 05:44:58,824 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 05:44:58,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 54 [2023-11-29 05:44:58,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:44:58,970 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 65 treesize of output 47 [2023-11-29 05:44:59,176 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 62 treesize of output 34 [2023-11-29 05:44:59,258 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:44:59,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 22 [2023-11-29 05:44:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:44:59,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:59,494 INFO L349 Elim1Store]: treesize reduction 5, result has 90.0 percent of original size [2023-11-29 05:44:59,494 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 54 treesize of output 53 [2023-11-29 05:45:00,459 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 341 treesize of output 285 [2023-11-29 05:45:00,463 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 229 treesize of output 189 [2023-11-29 05:45:00,960 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 712 treesize of output 688 [2023-11-29 05:45:01,000 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-11-29 05:45:01,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-29 05:45:01,035 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2023-11-29 05:45:01,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2023-11-29 05:45:01,052 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 11 treesize of output 9 [2023-11-29 05:45:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:45:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107344686] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:01,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 26] total 60 [2023-11-29 05:45:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093956518] [2023-11-29 05:45:01,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:01,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 05:45:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 05:45:01,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3414, Unknown=1, NotChecked=0, Total=3660 [2023-11-29 05:45:01,621 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 61 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 55 states have internal predecessors, (102), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:45:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:12,200 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2023-11-29 05:45:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-29 05:45:12,201 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 55 states have internal predecessors, (102), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2023-11-29 05:45:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:12,202 INFO L225 Difference]: With dead ends: 140 [2023-11-29 05:45:12,202 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 05:45:12,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2759 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1149, Invalid=9770, Unknown=1, NotChecked=0, Total=10920 [2023-11-29 05:45:12,205 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 538 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:12,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 701 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 05:45:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 05:45:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2023-11-29 05:45:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.308641975308642) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:45:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2023-11-29 05:45:12,207 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 45 [2023-11-29 05:45:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:12,208 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2023-11-29 05:45:12,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 55 states have internal predecessors, (102), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:45:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2023-11-29 05:45:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:45:12,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:12,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:12,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 05:45:12,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 05:45:12,409 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:45:12,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1173087026, now seen corresponding path program 1 times [2023-11-29 05:45:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575165032] [2023-11-29 05:45:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:45:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:45:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:45:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575165032] [2023-11-29 05:45:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575165032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017482487] [2023-11-29 05:45:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:14,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:14,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:14,940 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:14,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:45:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:15,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 05:45:15,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:15,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:45:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 05:45:15,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:45:15,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:45:15,681 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:45:15,681 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2023-11-29 05:45:15,693 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2023-11-29 05:45:15,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-11-29 05:45:16,906 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 05:45:16,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 68 [2023-11-29 05:45:16,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-11-29 05:45:17,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2023-11-29 05:45:17,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2023-11-29 05:45:17,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-11-29 05:45:17,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 05:45:17,563 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 15 treesize of output 7 [2023-11-29 05:45:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:45:17,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:19,563 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 593 treesize of output 497 [2023-11-29 05:45:19,567 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 400 treesize of output 324 [2023-11-29 05:45:20,488 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-11-29 05:45:20,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 464 treesize of output 455 [2023-11-29 05:45:20,500 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 726 treesize of output 702 [2023-11-29 05:45:20,545 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2023-11-29 05:45:20,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 183 [2023-11-29 05:45:20,556 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 156 treesize of output 152 [2023-11-29 05:45:20,617 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-11-29 05:45:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 334 treesize of output 1 [2023-11-29 05:45:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:45:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017482487] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:21,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 28] total 78 [2023-11-29 05:45:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626766933] [2023-11-29 05:45:21,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-11-29 05:45:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-11-29 05:45:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=5639, Unknown=0, NotChecked=0, Total=6006 [2023-11-29 05:45:21,244 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 78 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 71 states have internal predecessors, (107), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:45:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:26,773 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-11-29 05:45:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:45:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 71 states have internal predecessors, (107), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-11-29 05:45:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:26,774 INFO L225 Difference]: With dead ends: 87 [2023-11-29 05:45:26,774 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:45:26,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=701, Invalid=9001, Unknown=0, NotChecked=0, Total=9702 [2023-11-29 05:45:26,777 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 145 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:26,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 944 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 05:45:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:45:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-11-29 05:45:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 81 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:45:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-11-29 05:45:26,779 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 45 [2023-11-29 05:45:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:26,779 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-11-29 05:45:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 71 states have internal predecessors, (107), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:45:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-11-29 05:45:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:45:26,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:26,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 05:45:26,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 05:45:26,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 05:45:26,980 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:45:26,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -505943291, now seen corresponding path program 1 times [2023-11-29 05:45:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550779101] [2023-11-29 05:45:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:45:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:45:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:45:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550779101] [2023-11-29 05:45:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550779101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289364897] [2023-11-29 05:45:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:27,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:27,090 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:27,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 05:45:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:27,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:45:27,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:45:27,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:45:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289364897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:45:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-11-29 05:45:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494815751] [2023-11-29 05:45:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:27,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:45:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:27,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:45:27,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:45:27,456 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:45:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:27,485 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2023-11-29 05:45:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:45:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2023-11-29 05:45:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:27,486 INFO L225 Difference]: With dead ends: 52 [2023-11-29 05:45:27,486 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 05:45:27,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:45:27,486 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:27,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 05:45:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-29 05:45:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:45:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2023-11-29 05:45:27,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 53 [2023-11-29 05:45:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:27,488 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2023-11-29 05:45:27,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:45:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2023-11-29 05:45:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 05:45:27,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:27,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:27,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 05:45:27,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 05:45:27,689 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:45:27,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1495625337, now seen corresponding path program 1 times [2023-11-29 05:45:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274903116] [2023-11-29 05:45:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:45:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:45:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:45:30,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274903116] [2023-11-29 05:45:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274903116] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475571286] [2023-11-29 05:45:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:30,552 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:30,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 05:45:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:30,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 05:45:30,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:32,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 1 [2023-11-29 05:45:33,082 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2023-11-29 05:45:33,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 266 treesize of output 176 [2023-11-29 05:45:38,145 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 719 treesize of output 531 [2023-11-29 05:45:38,155 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 535 treesize of output 527 [2023-11-29 05:45:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:45:43,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:44,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:45:44,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 46 [2023-11-29 05:45:53,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (store (store |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) .cse0 0)) |c_ULTIMATE.start_main_~#s~0#1.base| 0) v_antiDerIndex_entry0_1))) is different from false [2023-11-29 05:45:53,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:45:53,402 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 58 treesize of output 50 [2023-11-29 05:45:53,404 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 58 treesize of output 46 [2023-11-29 05:46:11,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475571286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:46:11,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 48 [2023-11-29 05:46:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467663779] [2023-11-29 05:46:11,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:11,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 05:46:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:11,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 05:46:11,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3608, Unknown=8, NotChecked=120, Total=3906 [2023-11-29 05:46:11,406 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 50 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:46:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:48,156 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2023-11-29 05:46:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:46:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 54 [2023-11-29 05:46:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:48,157 INFO L225 Difference]: With dead ends: 51 [2023-11-29 05:46:48,157 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 05:46:48,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=384, Invalid=6584, Unknown=8, NotChecked=164, Total=7140 [2023-11-29 05:46:48,158 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 76 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:48,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 288 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1507 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 05:46:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 05:46:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 05:46:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:46:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-11-29 05:46:48,160 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 54 [2023-11-29 05:46:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:48,161 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-11-29 05:46:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:46:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-11-29 05:46:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 05:46:48,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:48,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:48,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 05:46:48,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:46:48,362 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-29 05:46:48,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -880207784, now seen corresponding path program 1 times [2023-11-29 05:46:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213428352] [2023-11-29 05:46:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:46:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:46:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213428352] [2023-11-29 05:46:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213428352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717518934] [2023-11-29 05:46:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:48,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:48,585 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:48,677 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2023-11-29 05:46:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:46:48,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-11-29 05:46:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:48,678 INFO L225 Difference]: With dead ends: 47 [2023-11-29 05:46:48,678 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:46:48,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:48,679 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:48,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:46:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:46:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:46:48,680 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 05:46:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:46:48,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-11-29 05:46:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:48,680 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:46:48,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:46:48,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:46:48,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 44 remaining) [2023-11-29 05:46:48,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 44 remaining) [2023-11-29 05:46:48,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (27 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (26 of 44 remaining) [2023-11-29 05:46:48,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (25 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (20 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (19 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (18 of 44 remaining) [2023-11-29 05:46:48,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 44 remaining) [2023-11-29 05:46:48,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (7 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (6 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 44 remaining) [2023-11-29 05:46:48,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 44 remaining) [2023-11-29 05:46:48,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 05:46:48,692 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:48,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:46:48,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:46:48 BoogieIcfgContainer [2023-11-29 05:46:48,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:46:48,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:46:48,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:46:48,699 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:46:48,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:43:59" (3/4) ... [2023-11-29 05:46:48,701 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:46:48,705 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-29 05:46:48,712 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2023-11-29 05:46:48,712 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 05:46:48,713 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:46:48,713 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:46:48,813 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:46:48,813 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:46:48,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:46:48,814 INFO L158 Benchmark]: Toolchain (without parser) took 170638.24ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 94.7MB in the beginning and 332.1MB in the end (delta: -237.4MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,815 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:46:48,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.19ms. Allocated memory is still 132.1MB. Free memory was 94.2MB in the beginning and 77.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,816 INFO L158 Benchmark]: Boogie Preprocessor took 56.15ms. Allocated memory is still 132.1MB. Free memory was 74.4MB in the beginning and 71.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,816 INFO L158 Benchmark]: RCFGBuilder took 552.00ms. Allocated memory is still 132.1MB. Free memory was 71.6MB in the beginning and 46.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,816 INFO L158 Benchmark]: TraceAbstraction took 169470.44ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 46.0MB in the beginning and 338.4MB in the end (delta: -292.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:46:48,817 INFO L158 Benchmark]: Witness Printer took 115.31ms. Allocated memory is still 406.8MB. Free memory was 338.4MB in the beginning and 332.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:46:48,818 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.20ms. Allocated memory is still 132.1MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.19ms. Allocated memory is still 132.1MB. Free memory was 94.2MB in the beginning and 77.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.15ms. Allocated memory is still 132.1MB. Free memory was 74.4MB in the beginning and 71.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.00ms. Allocated memory is still 132.1MB. Free memory was 71.6MB in the beginning and 46.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 169470.44ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 46.0MB in the beginning and 338.4MB in the end (delta: -292.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 115.31ms. Allocated memory is still 406.8MB. Free memory was 338.4MB in the beginning and 332.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 608]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 608]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 169.4s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 68.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3445 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3439 mSDsluCounter, 12962 SdHoareTripleChecker+Invalid, 22.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1552 IncrementalHoareTripleChecker+Unchecked, 11082 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19693 IncrementalHoareTripleChecker+Invalid, 21481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1880 mSDtfsCounter, 19693 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1971 GetRequests, 1020 SyntacticMatches, 25 SemanticMatches, 926 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 10303 ImplicationChecksByTransitivity, 99.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=24, InterpolantAutomatonStates: 511, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 380 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 90.9s InterpolantComputationTime, 2005 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2383 ConstructedInterpolants, 148 QuantifiedInterpolants, 44379 SizeOfPredicates, 248 NumberOfNonLiveVariables, 7152 ConjunctsInSsa, 838 ConjunctsInUnsatCore, 75 InterpolantComputations, 24 PerfectInterpolantSequences, 414/618 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 05:46:48,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d5d362-204a-41f1-94f4-7d7da9b98bd3/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