./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:12:46,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:12:46,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:12:46,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:12:46,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:12:46,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:12:46,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:12:46,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:12:46,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:12:46,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:12:46,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:12:46,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:12:46,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:12:46,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:12:46,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:12:46,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:12:46,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:12:46,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:12:46,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:12:46,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:12:46,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:12:46,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:46,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:12:46,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:12:46,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:12:46,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:12:46,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:12:46,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:12:46,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:12:46,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:12:46,659 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-13 13:12:46,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:12:47,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:12:47,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:12:47,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:12:47,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:12:47,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i Unable to find full path for "g++" [2024-11-13 13:12:49,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:12:49,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:12:49,874 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-13 13:12:49,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/data/250f8691b/213fb79baf9c452e970457217d1eedec/FLAGf849488e8 [2024-11-13 13:12:49,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/data/250f8691b/213fb79baf9c452e970457217d1eedec [2024-11-13 13:12:49,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:12:49,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:12:49,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:49,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:12:49,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:12:49,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:49" (1/1) ... [2024-11-13 13:12:49,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f6b08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:49, skipping insertion in model container [2024-11-13 13:12:49,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:49" (1/1) ... [2024-11-13 13:12:49,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:12:50,329 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:12:50,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:50,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:12:50,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:50,497 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:12:50,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50 WrapperNode [2024-11-13 13:12:50,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:50,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:50,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:12:50,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:12:50,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,577 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-13 13:12:50,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:50,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:12:50,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:12:50,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:12:50,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,633 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-13 13:12:50,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:12:50,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:12:50,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:12:50,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:12:50,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (1/1) ... [2024-11-13 13:12:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:50,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:12:50,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:12:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:12:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:12:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:12:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:12:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:12:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:12:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:12:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:12:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:12:50,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:12:50,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:12:51,416 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-13 13:12:51,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:12:51,436 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:12:51,439 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 13:12:51,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:51 BoogieIcfgContainer [2024-11-13 13:12:51,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:12:51,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:12:51,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:12:51,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:12:51,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:12:49" (1/3) ... [2024-11-13 13:12:51,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8425d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:51, skipping insertion in model container [2024-11-13 13:12:51,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:50" (2/3) ... [2024-11-13 13:12:51,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8425d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:51, skipping insertion in model container [2024-11-13 13:12:51,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:51" (3/3) ... [2024-11-13 13:12:51,456 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-13 13:12:51,478 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:12:51,480 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-2.i that has 1 procedures, 101 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2024-11-13 13:12:51,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:12:51,574 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7e0bae93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:12:51,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-13 13:12:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 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) [2024-11-13 13:12:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:12:51,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:51,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:12:51,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-13 13:12:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280690280] [2024-11-13 13:12:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280690280] [2024-11-13 13:12:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280690280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:12:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323833584] [2024-11-13 13:12:51,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:51,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:51,989 INFO L87 Difference]: Start difference. First operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-13 13:12:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:52,247 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-13 13:12:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:12:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 13:12:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:52,259 INFO L225 Difference]: With dead ends: 104 [2024-11-13 13:12:52,259 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 13:12:52,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:52,264 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 117 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:52,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 13:12:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-13 13:12:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 95 states have internal predecessors, (103), 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) [2024-11-13 13:12:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-13 13:12:52,309 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 4 [2024-11-13 13:12:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:52,309 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-13 13:12:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-13 13:12:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-13 13:12:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:12:52,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:52,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:12:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:12:52,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:52,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-13 13:12:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294283422] [2024-11-13 13:12:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294283422] [2024-11-13 13:12:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294283422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:52,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:12:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111981132] [2024-11-13 13:12:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:52,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:52,714 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-13 13:12:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:52,997 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-13 13:12:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:12:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 13:12:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:52,999 INFO L225 Difference]: With dead ends: 135 [2024-11-13 13:12:52,999 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 13:12:53,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:53,001 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:53,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 98 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 13:12:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2024-11-13 13:12:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 104 states have internal predecessors, (118), 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) [2024-11-13 13:12:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-13 13:12:53,020 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 4 [2024-11-13 13:12:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:53,020 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-13 13:12:53,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-13 13:12:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-13 13:12:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:12:53,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:12:53,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:12:53,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:53,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-13 13:12:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914786703] [2024-11-13 13:12:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914786703] [2024-11-13 13:12:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914786703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924209005] [2024-11-13 13:12:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:53,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:53,114 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-13 13:12:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:53,237 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-13 13:12:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:53,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 13:12:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:53,239 INFO L225 Difference]: With dead ends: 103 [2024-11-13 13:12:53,239 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 13:12:53,240 INFO L431 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 [2024-11-13 13:12:53,241 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:53,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:12:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 13:12:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 13:12:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 102 states have internal predecessors, (116), 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) [2024-11-13 13:12:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-13 13:12:53,251 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-11-13 13:12:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-13 13:12:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-13 13:12:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-13 13:12:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:12:53,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:12:53,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:12:53,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-13 13:12:53,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109225359] [2024-11-13 13:12:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109225359] [2024-11-13 13:12:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109225359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:53,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767422909] [2024-11-13 13:12:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:53,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:53,418 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-13 13:12:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:53,524 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-11-13 13:12:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 13:12:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:53,526 INFO L225 Difference]: With dead ends: 101 [2024-11-13 13:12:53,526 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 13:12:53,526 INFO L431 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 [2024-11-13 13:12:53,527 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:53,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:12:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 13:12:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 13:12:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 100 states have internal predecessors, (114), 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) [2024-11-13 13:12:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-13 13:12:53,548 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 5 [2024-11-13 13:12:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:53,549 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-13 13:12:53,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-13 13:12:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-13 13:12:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:53,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:12:53,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2024-11-13 13:12:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28713431] [2024-11-13 13:12:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:53,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28713431] [2024-11-13 13:12:53,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28713431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:53,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508852542] [2024-11-13 13:12:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:53,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:53,752 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-13 13:12:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:53,867 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-13 13:12:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:12:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:53,869 INFO L225 Difference]: With dead ends: 97 [2024-11-13 13:12:53,872 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 13:12:53,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:53,873 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:53,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:12:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 13:12:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-13 13:12:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 96 states have internal predecessors, (110), 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) [2024-11-13 13:12:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-13 13:12:53,889 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 9 [2024-11-13 13:12:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:53,931 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-13 13:12:53,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-13 13:12:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-13 13:12:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:53,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:53,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:12:53,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:53,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2024-11-13 13:12:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575407794] [2024-11-13 13:12:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575407794] [2024-11-13 13:12:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575407794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:12:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790891923] [2024-11-13 13:12:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:54,173 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-13 13:12:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:54,273 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-13 13:12:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:54,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:12:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:54,275 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:12:54,275 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:12:54,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:54,276 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:54,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:12:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:12:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 13:12:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.606060606060606) internal successors, (106), 92 states have internal predecessors, (106), 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) [2024-11-13 13:12:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-11-13 13:12:54,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 9 [2024-11-13 13:12:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:54,289 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-11-13 13:12:54,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-13 13:12:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-11-13 13:12:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:12:54,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:54,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:54,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:12:54,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-11-13 13:12:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021062259] [2024-11-13 13:12:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:54,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021062259] [2024-11-13 13:12:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021062259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:54,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981571630] [2024-11-13 13:12:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:54,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:54,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:54,516 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-13 13:12:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:54,694 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-11-13 13:12:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:12:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:12:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:54,695 INFO L225 Difference]: With dead ends: 102 [2024-11-13 13:12:54,696 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 13:12:54,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:54,697 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:54,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 217 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 13:12:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-13 13:12:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.6) internal successors, (112), 96 states have internal predecessors, (112), 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) [2024-11-13 13:12:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-13 13:12:54,703 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 14 [2024-11-13 13:12:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:54,704 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-13 13:12:54,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-13 13:12:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-13 13:12:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:12:54,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:54,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:54,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:12:54,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-11-13 13:12:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724172865] [2024-11-13 13:12:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724172865] [2024-11-13 13:12:55,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724172865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:55,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:55,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:55,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5314883] [2024-11-13 13:12:55,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:55,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:55,133 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2024-11-13 13:12:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:55,374 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-13 13:12:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:55,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:12:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:55,375 INFO L225 Difference]: With dead ends: 97 [2024-11-13 13:12:55,376 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 13:12:55,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:55,377 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:55,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 13:12:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-13 13:12:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 96 states have internal predecessors, (110), 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) [2024-11-13 13:12:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-13 13:12:55,386 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2024-11-13 13:12:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:55,386 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-13 13:12:55,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2024-11-13 13:12:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-13 13:12:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 13:12:55,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:55,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:55,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:12:55,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash -79169355, now seen corresponding path program 1 times [2024-11-13 13:12:55,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656416109] [2024-11-13 13:12:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656416109] [2024-11-13 13:12:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656416109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279700343] [2024-11-13 13:12:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:55,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:55,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:55,630 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-13 13:12:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:55,773 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-13 13:12:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 13:12:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:55,775 INFO L225 Difference]: With dead ends: 157 [2024-11-13 13:12:55,775 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 13:12:55,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:55,776 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:55,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 293 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:12:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 13:12:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2024-11-13 13:12:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 96 states have internal predecessors, (109), 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) [2024-11-13 13:12:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-13 13:12:55,790 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 17 [2024-11-13 13:12:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-13 13:12:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-13 13:12:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-13 13:12:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 13:12:55,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:55,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:55,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:12:55,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:55,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -79169383, now seen corresponding path program 1 times [2024-11-13 13:12:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132721244] [2024-11-13 13:12:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132721244] [2024-11-13 13:12:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132721244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477176375] [2024-11-13 13:12:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:56,055 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-13 13:12:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:56,292 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2024-11-13 13:12:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:56,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 13:12:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:56,294 INFO L225 Difference]: With dead ends: 153 [2024-11-13 13:12:56,294 INFO L226 Difference]: Without dead ends: 153 [2024-11-13 13:12:56,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:12:56,296 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 95 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:56,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 200 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-13 13:12:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2024-11-13 13:12:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.542857142857143) internal successors, (108), 96 states have internal predecessors, (108), 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) [2024-11-13 13:12:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-13 13:12:56,301 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 17 [2024-11-13 13:12:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,301 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-13 13:12:56,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-13 13:12:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-13 13:12:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 13:12:56,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:56,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:12:56,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:56,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash -79169382, now seen corresponding path program 1 times [2024-11-13 13:12:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803028964] [2024-11-13 13:12:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803028964] [2024-11-13 13:12:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803028964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:56,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600417434] [2024-11-13 13:12:56,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:56,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:56,722 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-13 13:12:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:56,986 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-13 13:12:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 13:12:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:56,987 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:12:56,988 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:12:56,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:56,988 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:56,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 217 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:12:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 97. [2024-11-13 13:12:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 96 states have internal predecessors, (107), 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) [2024-11-13 13:12:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-13 13:12:56,996 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 17 [2024-11-13 13:12:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,996 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-13 13:12:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-13 13:12:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-13 13:12:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:12:56,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:57,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:12:57,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:57,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1499068093, now seen corresponding path program 1 times [2024-11-13 13:12:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715400158] [2024-11-13 13:12:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715400158] [2024-11-13 13:12:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715400158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:12:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635340553] [2024-11-13 13:12:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:12:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:57,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:12:57,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:12:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:57,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 13:12:57,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:12:57,566 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 [2024-11-13 13:12:57,611 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:12:57,612 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 17 treesize of output 21 [2024-11-13 13:12:57,682 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 19 treesize of output 1 [2024-11-13 13:12:57,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:12:57,869 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 13:12:57,934 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 13 [2024-11-13 13:12:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:12:58,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:12:58,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_207) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:12:58,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:58,117 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 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 13:12:58,125 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 40 treesize of output 28 [2024-11-13 13:12:58,136 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 9 treesize of output 5 [2024-11-13 13:12:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 13:12:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635340553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:12:58,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:12:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-11-13 13:12:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55335638] [2024-11-13 13:12:58,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:12:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:12:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=4, NotChecked=26, Total=240 [2024-11-13 13:12:58,223 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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) [2024-11-13 13:12:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:58,620 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-13 13:12:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:12:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 13:12:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:58,621 INFO L225 Difference]: With dead ends: 99 [2024-11-13 13:12:58,621 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 13:12:58,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=4, NotChecked=26, Total=240 [2024-11-13 13:12:58,622 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 15 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:58,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 415 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2024-11-13 13:12:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 13:12:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-13 13:12:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 95 states have internal predecessors, (106), 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) [2024-11-13 13:12:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-13 13:12:58,627 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2024-11-13 13:12:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:58,627 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-13 13:12:58,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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) [2024-11-13 13:12:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-13 13:12:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:12:58,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:58,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:58,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:12:58,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 13:12:58,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:12:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1499068094, now seen corresponding path program 1 times [2024-11-13 13:12:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473236113] [2024-11-13 13:12:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:59,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473236113] [2024-11-13 13:12:59,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473236113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:12:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982922591] [2024-11-13 13:12:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:12:59,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:59,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:12:59,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:12:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:59,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 13:12:59,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:12:59,604 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 [2024-11-13 13:12:59,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:12:59,636 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 [2024-11-13 13:12:59,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:12:59,674 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 19 treesize of output 1 [2024-11-13 13:12:59,686 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 13 treesize of output 9 [2024-11-13 13:12:59,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:12:59,869 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 13:12:59,878 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 30 treesize of output 13 [2024-11-13 13:12:59,969 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 13 [2024-11-13 13:12:59,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2024-11-13 13:13:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:00,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:00,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_264) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_265) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_264 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_264) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4)))))) is different from false [2024-11-13 13:13:00,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_264) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_264) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_265) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:13:00,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:00,314 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 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-13 13:13:00,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:00,324 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 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 13:13:00,331 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 50 [2024-11-13 13:13:00,338 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 96 treesize of output 78 [2024-11-13 13:13:00,347 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 15 treesize of output 11 [2024-11-13 13:13:00,350 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 7 [2024-11-13 13:13:00,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:00,367 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 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 13:13:00,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:00,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2024-11-13 13:13:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 13:13:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982922591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:00,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2024-11-13 13:13:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441493389] [2024-11-13 13:13:00,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:00,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 13:13:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:00,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 13:13:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=277, Unknown=6, NotChecked=70, Total=420 [2024-11-13 13:13:00,454 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 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) [2024-11-13 13:13:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:01,471 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-11-13 13:13:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:13:01,473 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 13:13:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:01,474 INFO L225 Difference]: With dead ends: 106 [2024-11-13 13:13:01,474 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 13:13:01,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=8, NotChecked=106, Total=870 [2024-11-13 13:13:01,475 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:01,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 676 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 486 Invalid, 15 Unknown, 115 Unchecked, 0.6s Time] [2024-11-13 13:13:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 13:13:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 13:13:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.4625) internal successors, (117), 105 states have internal predecessors, (117), 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) [2024-11-13 13:13:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-13 13:13:01,482 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 19 [2024-11-13 13:13:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:01,483 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-13 13:13:01,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 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) [2024-11-13 13:13:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-13 13:13:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:13:01,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:01,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:01,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:13:01,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 13:13:01,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -597981848, now seen corresponding path program 1 times [2024-11-13 13:13:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840532551] [2024-11-13 13:13:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:01,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:01,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840532551] [2024-11-13 13:13:01,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840532551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825774847] [2024-11-13 13:13:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:01,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:01,853 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-13 13:13:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,078 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2024-11-13 13:13:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:02,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 13:13:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:02,080 INFO L225 Difference]: With dead ends: 169 [2024-11-13 13:13:02,080 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 13:13:02,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:13:02,081 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 87 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:02,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 202 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 13:13:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 106. [2024-11-13 13:13:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.45) internal successors, (116), 105 states have internal predecessors, (116), 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) [2024-11-13 13:13:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-13 13:13:02,086 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 20 [2024-11-13 13:13:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:02,087 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-13 13:13:02,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-13 13:13:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-13 13:13:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 13:13:02,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:02,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:13:02,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:02,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -597981847, now seen corresponding path program 1 times [2024-11-13 13:13:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028152907] [2024-11-13 13:13:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028152907] [2024-11-13 13:13:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028152907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984967230] [2024-11-13 13:13:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:02,422 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-13 13:13:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,692 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2024-11-13 13:13:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:02,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 13:13:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:02,694 INFO L225 Difference]: With dead ends: 171 [2024-11-13 13:13:02,694 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 13:13:02,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:02,695 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:02,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 213 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 13:13:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 106. [2024-11-13 13:13:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.4375) internal successors, (115), 105 states have internal predecessors, (115), 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) [2024-11-13 13:13:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-13 13:13:02,706 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 20 [2024-11-13 13:13:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:02,706 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-13 13:13:02,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-13 13:13:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-13 13:13:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 13:13:02,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:02,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:13:02,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:02,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1047178718, now seen corresponding path program 1 times [2024-11-13 13:13:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665269530] [2024-11-13 13:13:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665269530] [2024-11-13 13:13:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665269530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781990046] [2024-11-13 13:13:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:13:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:13:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:13:03,226 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2024-11-13 13:13:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,539 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2024-11-13 13:13:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:13:03,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 13:13:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,541 INFO L225 Difference]: With dead ends: 133 [2024-11-13 13:13:03,541 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 13:13:03,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:13:03,543 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 439 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 13:13:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2024-11-13 13:13:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 120 states have internal predecessors, (131), 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) [2024-11-13 13:13:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-13 13:13:03,548 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 23 [2024-11-13 13:13:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-13 13:13:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2024-11-13 13:13:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-13 13:13:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 13:13:03,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:13:03,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1316368411, now seen corresponding path program 1 times [2024-11-13 13:13:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684990135] [2024-11-13 13:13:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684990135] [2024-11-13 13:13:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684990135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101378498] [2024-11-13 13:13:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:03,717 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2024-11-13 13:13:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,827 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2024-11-13 13:13:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:03,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-13 13:13:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,829 INFO L225 Difference]: With dead ends: 148 [2024-11-13 13:13:03,829 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 13:13:03,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:03,830 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 222 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 13:13:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2024-11-13 13:13:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 132 states have internal predecessors, (156), 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) [2024-11-13 13:13:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2024-11-13 13:13:03,840 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 25 [2024-11-13 13:13:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,841 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2024-11-13 13:13:03,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2024-11-13 13:13:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2024-11-13 13:13:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 13:13:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:13:03,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2142252052, now seen corresponding path program 1 times [2024-11-13 13:13:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732197751] [2024-11-13 13:13:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732197751] [2024-11-13 13:13:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732197751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723723366] [2024-11-13 13:13:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:04,016 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-13 13:13:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:04,177 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2024-11-13 13:13:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:13:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 13:13:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:04,178 INFO L225 Difference]: With dead ends: 188 [2024-11-13 13:13:04,179 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 13:13:04,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:04,180 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 70 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:04,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 247 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 13:13:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 134. [2024-11-13 13:13:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 133 states have internal predecessors, (157), 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) [2024-11-13 13:13:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-13 13:13:04,190 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 26 [2024-11-13 13:13:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:04,190 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-13 13:13:04,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-13 13:13:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-13 13:13:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:13:04,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:04,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:13:04,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1985304003, now seen corresponding path program 1 times [2024-11-13 13:13:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538250024] [2024-11-13 13:13:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538250024] [2024-11-13 13:13:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538250024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998964652] [2024-11-13 13:13:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:04,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:04,393 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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) [2024-11-13 13:13:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:04,667 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2024-11-13 13:13:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:13:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:04,669 INFO L225 Difference]: With dead ends: 191 [2024-11-13 13:13:04,669 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 13:13:04,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:13:04,670 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 61 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:04,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 231 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 13:13:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2024-11-13 13:13:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 136 states have internal predecessors, (160), 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) [2024-11-13 13:13:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2024-11-13 13:13:04,677 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 27 [2024-11-13 13:13:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:04,677 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2024-11-13 13:13:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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) [2024-11-13 13:13:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2024-11-13 13:13:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:04,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:04,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:04,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:13:04,679 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1414881777, now seen corresponding path program 1 times [2024-11-13 13:13:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826012705] [2024-11-13 13:13:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826012705] [2024-11-13 13:13:05,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826012705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:05,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:13:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214567373] [2024-11-13 13:13:05,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:13:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:13:05,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:05,005 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-11-13 13:13:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:05,236 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2024-11-13 13:13:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:05,238 INFO L225 Difference]: With dead ends: 157 [2024-11-13 13:13:05,238 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 13:13:05,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:05,239 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 153 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:05,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 149 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 13:13:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2024-11-13 13:13:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 137 states have internal predecessors, (162), 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) [2024-11-13 13:13:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2024-11-13 13:13:05,246 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 28 [2024-11-13 13:13:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:05,246 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2024-11-13 13:13:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-11-13 13:13:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2024-11-13 13:13:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:05,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:05,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:13:05,247 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1414881776, now seen corresponding path program 1 times [2024-11-13 13:13:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542066012] [2024-11-13 13:13:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542066012] [2024-11-13 13:13:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542066012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:13:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952915163] [2024-11-13 13:13:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:05,328 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-13 13:13:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:05,403 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2024-11-13 13:13:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:05,405 INFO L225 Difference]: With dead ends: 133 [2024-11-13 13:13:05,405 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 13:13:05,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:05,406 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:05,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 53 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 13:13:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-13 13:13:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.375) internal successors, (154), 132 states have internal predecessors, (154), 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) [2024-11-13 13:13:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2024-11-13 13:13:05,413 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 28 [2024-11-13 13:13:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2024-11-13 13:13:05,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-13 13:13:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2024-11-13 13:13:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:05,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:05,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:05,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:13:05,418 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1201017024, now seen corresponding path program 1 times [2024-11-13 13:13:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992387007] [2024-11-13 13:13:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992387007] [2024-11-13 13:13:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992387007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95860757] [2024-11-13 13:13:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:13:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:13:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:05,879 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2024-11-13 13:13:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:06,485 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-13 13:13:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:13:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:06,486 INFO L225 Difference]: With dead ends: 154 [2024-11-13 13:13:06,487 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 13:13:06,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:13:06,493 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:06,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 433 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 13:13:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-13 13:13:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 137 states have internal predecessors, (161), 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) [2024-11-13 13:13:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2024-11-13 13:13:06,503 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 28 [2024-11-13 13:13:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2024-11-13 13:13:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2024-11-13 13:13:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2024-11-13 13:13:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:06,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:06,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:13:06,506 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:06,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1201017023, now seen corresponding path program 1 times [2024-11-13 13:13:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807213246] [2024-11-13 13:13:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807213246] [2024-11-13 13:13:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807213246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:07,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:07,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406133830] [2024-11-13 13:13:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:13:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:13:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:07,166 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2024-11-13 13:13:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:07,624 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2024-11-13 13:13:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:13:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:07,627 INFO L225 Difference]: With dead ends: 189 [2024-11-13 13:13:07,628 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 13:13:07,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:13:07,629 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:07,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 366 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 13:13:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 164. [2024-11-13 13:13:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 163 states have internal predecessors, (193), 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) [2024-11-13 13:13:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2024-11-13 13:13:07,637 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 28 [2024-11-13 13:13:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:07,637 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2024-11-13 13:13:07,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2024-11-13 13:13:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2024-11-13 13:13:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:13:07,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:07,638 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:13:07,638 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1254039198, now seen corresponding path program 2 times [2024-11-13 13:13:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980042441] [2024-11-13 13:13:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980042441] [2024-11-13 13:13:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980042441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126955118] [2024-11-13 13:13:08,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:13:08,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:08,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:08,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:08,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:13:08,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:13:08,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:13:08,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 13:13:08,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:08,728 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 [2024-11-13 13:13:08,754 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:08,754 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 [2024-11-13 13:13:08,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:13:08,781 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 19 treesize of output 1 [2024-11-13 13:13:08,792 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 13 treesize of output 9 [2024-11-13 13:13:08,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:13:08,937 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 13:13:08,946 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 30 treesize of output 13 [2024-11-13 13:13:09,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:13:09,144 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 13:13:09,152 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 30 treesize of output 13 [2024-11-13 13:13:09,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:13:09,379 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 13:13:09,393 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 30 treesize of output 13 [2024-11-13 13:13:09,492 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 13 [2024-11-13 13:13:09,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2024-11-13 13:13:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:09,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:09,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_601 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2024-11-13 13:13:09,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_601 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:13:09,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_601 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:13:09,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) .cse2 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-13 13:13:09,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_598) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_599))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_598) .cse3 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2024-11-13 13:13:10,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_599))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) .cse1 v_ArrVal_598) .cse2 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) .cse6 v_ArrVal_598) (select (select (store .cse7 .cse6 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_601))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))))) is different from false [2024-11-13 13:13:10,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_597))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_599))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) .cse2 v_ArrVal_598) .cse3 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_597))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) .cse7 v_ArrVal_598) (select (select (store .cse8 .cse7 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_601))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:13:10,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_599))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse1 v_ArrVal_598) .cse2 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse6 v_ArrVal_598) (select (select (store .cse7 .cse6 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_601))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-11-13 13:13:10,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:10,125 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 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-13 13:13:10,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:10,134 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 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-13 13:13:10,141 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 738 treesize of output 636 [2024-11-13 13:13:10,162 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 991 treesize of output 949 [2024-11-13 13:13:10,175 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 160 treesize of output 144 [2024-11-13 13:13:10,181 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 144 treesize of output 136 [2024-11-13 13:13:10,186 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 136 treesize of output 124 [2024-11-13 13:13:10,191 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 124 treesize of output 104 [2024-11-13 13:13:10,198 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 76 treesize of output 72 [2024-11-13 13:13:10,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:10,241 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 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-13 13:13:10,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:10,251 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 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-13 13:13:10,255 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:10,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 916 treesize of output 610 [2024-11-13 13:13:10,275 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:10,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-13 13:13:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2024-11-13 13:13:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126955118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:10,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 34 [2024-11-13 13:13:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855118862] [2024-11-13 13:13:10,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 13:13:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 13:13:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=580, Unknown=15, NotChecked=456, Total=1190 [2024-11-13 13:13:10,375 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 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) [2024-11-13 13:13:12,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_601 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (<= (+ .cse2 .cse3 8) (select |c_#length| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= 0 (+ .cse2 .cse3 4))))) is different from false [2024-11-13 13:13:12,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_601 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (<= 0 (+ .cse2 .cse3)) (<= (+ .cse2 .cse3 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_601) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:13:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:12,472 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2024-11-13 13:13:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:13:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 13:13:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:12,476 INFO L225 Difference]: With dead ends: 191 [2024-11-13 13:13:12,476 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 13:13:12,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=308, Invalid=1350, Unknown=22, NotChecked=870, Total=2550 [2024-11-13 13:13:12,479 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 103 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 12 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:12,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 913 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 569 Invalid, 7 Unknown, 715 Unchecked, 0.8s Time] [2024-11-13 13:13:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 13:13:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2024-11-13 13:13:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 183 states have internal predecessors, (215), 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) [2024-11-13 13:13:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 215 transitions. [2024-11-13 13:13:12,489 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 215 transitions. Word has length 29 [2024-11-13 13:13:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:12,489 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 215 transitions. [2024-11-13 13:13:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 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) [2024-11-13 13:13:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 215 transitions. [2024-11-13 13:13:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:13:12,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:12,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:12,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:13:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:13:12,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:12,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1874471451, now seen corresponding path program 1 times [2024-11-13 13:13:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696266710] [2024-11-13 13:13:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696266710] [2024-11-13 13:13:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696266710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:13,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142721050] [2024-11-13 13:13:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:13,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:13:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:13:13,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:13,105 INFO L87 Difference]: Start difference. First operand 184 states and 215 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-11-13 13:13:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:13,727 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2024-11-13 13:13:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:13:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:13:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:13,729 INFO L225 Difference]: With dead ends: 203 [2024-11-13 13:13:13,729 INFO L226 Difference]: Without dead ends: 203 [2024-11-13 13:13:13,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:13:13,730 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:13,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 452 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-13 13:13:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 184. [2024-11-13 13:13:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.298780487804878) internal successors, (213), 183 states have internal predecessors, (213), 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) [2024-11-13 13:13:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2024-11-13 13:13:13,743 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 31 [2024-11-13 13:13:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:13,743 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2024-11-13 13:13:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-11-13 13:13:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2024-11-13 13:13:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:13:13,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:13,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:13:13,745 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:13,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1874460466, now seen corresponding path program 1 times [2024-11-13 13:13:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970136056] [2024-11-13 13:13:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970136056] [2024-11-13 13:13:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970136056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:13:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181685715] [2024-11-13 13:13:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:13:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:13:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:13:14,677 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) [2024-11-13 13:13:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:15,431 INFO L93 Difference]: Finished difference Result 207 states and 235 transitions. [2024-11-13 13:13:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:13:15,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:13:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:15,434 INFO L225 Difference]: With dead ends: 207 [2024-11-13 13:13:15,434 INFO L226 Difference]: Without dead ends: 207 [2024-11-13 13:13:15,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:13:15,436 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 75 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:15,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 599 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-13 13:13:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2024-11-13 13:13:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 183 states have internal predecessors, (212), 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) [2024-11-13 13:13:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2024-11-13 13:13:15,445 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 31 [2024-11-13 13:13:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2024-11-13 13:13:15,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) [2024-11-13 13:13:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2024-11-13 13:13:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 13:13:15,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:15,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:15,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 13:13:15,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2021267551, now seen corresponding path program 1 times [2024-11-13 13:13:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:15,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297622008] [2024-11-13 13:13:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:16,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:16,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297622008] [2024-11-13 13:13:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297622008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:13:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641360678] [2024-11-13 13:13:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:16,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:13:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:13:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:13:16,467 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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) [2024-11-13 13:13:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:17,290 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2024-11-13 13:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:13:17,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-13 13:13:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:17,292 INFO L225 Difference]: With dead ends: 199 [2024-11-13 13:13:17,292 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 13:13:17,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:13:17,294 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:17,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 613 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 13:13:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2024-11-13 13:13:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 178 states have internal predecessors, (204), 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) [2024-11-13 13:13:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-13 13:13:17,300 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 32 [2024-11-13 13:13:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:17,301 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-13 13:13:17,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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) [2024-11-13 13:13:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-13 13:13:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:13:17,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:17,302 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:17,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 13:13:17,302 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:17,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash -869279064, now seen corresponding path program 1 times [2024-11-13 13:13:17,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:17,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056665196] [2024-11-13 13:13:17,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:17,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056665196] [2024-11-13 13:13:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056665196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857530753] [2024-11-13 13:13:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:17,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:17,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:17,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:17,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:13:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:17,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:13:17,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:18,212 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 13:13:18,212 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 23 treesize of output 15 [2024-11-13 13:13:18,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:18,896 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 97 treesize of output 69 [2024-11-13 13:13:18,904 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 13 [2024-11-13 13:13:19,179 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| Int) (|v_ULTIMATE.start_main_#t~mem22#1.base_9| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|) 0) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0) |v_ULTIMATE.start_main_~#list~0#1.base_22| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_9|) 0))) is different from true [2024-11-13 13:13:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:19,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:19,445 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 [2024-11-13 13:13:19,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (v_ArrVal_771 Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_771) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-13 13:13:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:19,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857530753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:19,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:19,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-13 13:13:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214803726] [2024-11-13 13:13:19,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:19,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:13:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:19,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:13:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=397, Unknown=3, NotChecked=82, Total=552 [2024-11-13 13:13:19,738 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 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) [2024-11-13 13:13:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:21,022 INFO L93 Difference]: Finished difference Result 256 states and 286 transitions. [2024-11-13 13:13:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:13:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:13:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:21,025 INFO L225 Difference]: With dead ends: 256 [2024-11-13 13:13:21,025 INFO L226 Difference]: Without dead ends: 254 [2024-11-13 13:13:21,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=729, Unknown=3, NotChecked=114, Total=992 [2024-11-13 13:13:21,026 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 99 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:21,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 538 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 475 Invalid, 0 Unknown, 277 Unchecked, 0.6s Time] [2024-11-13 13:13:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-13 13:13:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 208. [2024-11-13 13:13:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 188 states have (on average 1.25) internal successors, (235), 207 states have internal predecessors, (235), 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) [2024-11-13 13:13:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2024-11-13 13:13:21,035 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 33 [2024-11-13 13:13:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:21,035 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2024-11-13 13:13:21,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 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) [2024-11-13 13:13:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2024-11-13 13:13:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:13:21,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:21,036 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 13:13:21,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:13:21,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:13:21,242 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:21,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash -869279092, now seen corresponding path program 1 times [2024-11-13 13:13:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341632720] [2024-11-13 13:13:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:22,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:22,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341632720] [2024-11-13 13:13:22,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341632720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:22,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583509206] [2024-11-13 13:13:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:22,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:22,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:22,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:13:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:22,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 13:13:22,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:22,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:22,632 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 15 treesize of output 7 [2024-11-13 13:13:22,708 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 15 treesize of output 11 [2024-11-13 13:13:22,724 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 [2024-11-13 13:13:22,907 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 27 treesize of output 15 [2024-11-13 13:13:22,927 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 23 treesize of output 11 [2024-11-13 13:13:23,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:23,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 15 [2024-11-13 13:13:23,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:23,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:23,254 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 29 treesize of output 19 [2024-11-13 13:13:23,281 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-13 13:13:23,281 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 29 treesize of output 19 [2024-11-13 13:13:23,637 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 13:13:23,644 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 [2024-11-13 13:13:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:23,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:23,977 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 [2024-11-13 13:13:24,264 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 350 treesize of output 318 [2024-11-13 13:13:24,304 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 56 treesize of output 40 [2024-11-13 13:13:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583509206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:24,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2024-11-13 13:13:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633336899] [2024-11-13 13:13:24,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 13:13:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 13:13:24,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-11-13 13:13:24,558 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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) [2024-11-13 13:13:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:25,592 INFO L93 Difference]: Finished difference Result 270 states and 301 transitions. [2024-11-13 13:13:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:13:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:13:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:25,595 INFO L225 Difference]: With dead ends: 270 [2024-11-13 13:13:25,595 INFO L226 Difference]: Without dead ends: 252 [2024-11-13 13:13:25,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 13:13:25,596 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 139 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:25,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1229 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-13 13:13:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 190. [2024-11-13 13:13:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.2705882352941176) internal successors, (216), 189 states have internal predecessors, (216), 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) [2024-11-13 13:13:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2024-11-13 13:13:25,604 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 33 [2024-11-13 13:13:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:25,604 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2024-11-13 13:13:25,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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) [2024-11-13 13:13:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2024-11-13 13:13:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 13:13:25,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:25,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:25,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:13:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 13:13:25,810 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -785628890, now seen corresponding path program 1 times [2024-11-13 13:13:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161326770] [2024-11-13 13:13:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161326770] [2024-11-13 13:13:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161326770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:26,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:13:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129639086] [2024-11-13 13:13:26,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:26,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:13:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:13:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:13:26,376 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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) [2024-11-13 13:13:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:26,897 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2024-11-13 13:13:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:13:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 13:13:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:26,899 INFO L225 Difference]: With dead ends: 212 [2024-11-13 13:13:26,899 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 13:13:26,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-13 13:13:26,902 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:26,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 302 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 13:13:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2024-11-13 13:13:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 172 states have (on average 1.2674418604651163) internal successors, (218), 191 states have internal predecessors, (218), 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) [2024-11-13 13:13:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 218 transitions. [2024-11-13 13:13:26,909 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 218 transitions. Word has length 34 [2024-11-13 13:13:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:26,910 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 218 transitions. [2024-11-13 13:13:26,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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) [2024-11-13 13:13:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2024-11-13 13:13:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:13:26,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:26,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:26,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 13:13:26,912 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1393361757, now seen corresponding path program 1 times [2024-11-13 13:13:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442563386] [2024-11-13 13:13:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442563386] [2024-11-13 13:13:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442563386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:13:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386378087] [2024-11-13 13:13:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:13:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:13:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:13:27,528 INFO L87 Difference]: Start difference. First operand 192 states and 218 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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) [2024-11-13 13:13:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:28,394 INFO L93 Difference]: Finished difference Result 268 states and 293 transitions. [2024-11-13 13:13:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:13:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 13:13:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:28,396 INFO L225 Difference]: With dead ends: 268 [2024-11-13 13:13:28,396 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 13:13:28,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:13:28,397 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:28,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 579 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:13:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 13:13:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 195. [2024-11-13 13:13:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 175 states have (on average 1.262857142857143) internal successors, (221), 194 states have internal predecessors, (221), 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) [2024-11-13 13:13:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2024-11-13 13:13:28,405 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 37 [2024-11-13 13:13:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2024-11-13 13:13:28,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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) [2024-11-13 13:13:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2024-11-13 13:13:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 13:13:28,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:28,406 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 13:13:28,407 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 610158986, now seen corresponding path program 1 times [2024-11-13 13:13:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275588642] [2024-11-13 13:13:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275588642] [2024-11-13 13:13:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275588642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:28,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:13:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897715711] [2024-11-13 13:13:28,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:28,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:13:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:28,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:13:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:13:28,896 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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) [2024-11-13 13:13:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:29,406 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2024-11-13 13:13:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:13:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 13:13:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:29,407 INFO L225 Difference]: With dead ends: 218 [2024-11-13 13:13:29,408 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 13:13:29,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:29,409 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 72 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:29,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 542 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 13:13:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2024-11-13 13:13:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 175 states have (on average 1.2514285714285713) internal successors, (219), 194 states have internal predecessors, (219), 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) [2024-11-13 13:13:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2024-11-13 13:13:29,419 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 38 [2024-11-13 13:13:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:29,420 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2024-11-13 13:13:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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) [2024-11-13 13:13:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2024-11-13 13:13:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 13:13:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:29,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 13:13:29,422 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -244541335, now seen corresponding path program 1 times [2024-11-13 13:13:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761877104] [2024-11-13 13:13:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761877104] [2024-11-13 13:13:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761877104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039673073] [2024-11-13 13:13:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:29,665 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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) [2024-11-13 13:13:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:29,901 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2024-11-13 13:13:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:13:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 13:13:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:29,902 INFO L225 Difference]: With dead ends: 208 [2024-11-13 13:13:29,903 INFO L226 Difference]: Without dead ends: 208 [2024-11-13 13:13:29,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:29,903 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 138 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:29,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 185 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-13 13:13:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2024-11-13 13:13:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.263157894736842) internal successors, (216), 190 states have internal predecessors, (216), 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) [2024-11-13 13:13:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2024-11-13 13:13:29,912 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 38 [2024-11-13 13:13:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2024-11-13 13:13:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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) [2024-11-13 13:13:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2024-11-13 13:13:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:13:29,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:29,914 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 13:13:29,915 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:13:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 741230734, now seen corresponding path program 1 times [2024-11-13 13:13:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110650132] [2024-11-13 13:13:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110650132] [2024-11-13 13:13:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110650132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758395784] [2024-11-13 13:13:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:31,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:31,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e49c6c-379b-452e-b3f3-fbb77aa2e535/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:13:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:31,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 13:13:31,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:33,111 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 15 treesize of output 1 [2024-11-13 13:13:33,355 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 13:13:33,355 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 23 treesize of output 15 [2024-11-13 13:13:35,760 INFO L349 Elim1Store]: treesize reduction 48, result has 56.0 percent of original size [2024-11-13 13:13:35,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 326 [2024-11-13 13:14:29,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse40 (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse1 (= .cse40 0))) (and (or .cse0 (not .cse1)) (let ((.cse42 (store |c_ULTIMATE.start_main_old_#valid#1| .cse40 1)) (.cse36 (= .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse93 (exists ((v_prenex_1 Int)) (not (= (select .cse7 v_prenex_1) 0)))) (.cse8 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (let ((.cse15 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse171 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse170 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse171 1)) (.cse172 (select .cse7 v_prenex_1))) (and (= (select .cse170 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse170 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse171 1) v_arrayElimCell_56 0)) (not (= .cse172 0)) (not (= 0 .cse171)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse171) (not (= .cse172 .cse171))))))) (.cse16 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse166 (select .cse7 v_prenex_1))) (let ((.cse168 (store (store .cse8 .cse166 1) v_arrayElimCell_58 (select |c_#valid| v_arrayElimCell_58)))) (let ((.cse169 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)) (.cse167 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse168 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse166 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse166) 0) (= (select .cse167 v_arrayElimCell_58) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_58)) (not (= .cse166 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse166 0)) (= |c_#valid| (store .cse168 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse169)) (not (= .cse166 .cse169)) (= (select .cse167 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse27 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse165 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse163 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse165 1)) (.cse164 (select .cse7 v_prenex_1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse163 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse163 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse164 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse165 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse165)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse165) (not (= .cse164 .cse165))))))) (.cse28 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse160 (select .cse7 v_prenex_1))) (let ((.cse162 (store (store .cse8 .cse160 1) v_arrayElimCell_58 (select |c_#valid| v_arrayElimCell_58)))) (let ((.cse161 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse160 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse160) 0) (= (select .cse161 v_arrayElimCell_58) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_58)) (not (= .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse160 0)) (= |c_#valid| (store .cse162 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse160 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= (select .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse2 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse159 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse158 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse159 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse158 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse158 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse159 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse159)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse159) (not (= (select .cse7 v_prenex_1) .cse159))))))) (.cse12 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse157 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse157 1))) (and (= (select .cse156 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse157 1) v_arrayElimCell_56 0)) (not (= 0 .cse157)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse157) (not (= (select .cse7 v_prenex_1) .cse157))))))) (.cse82 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= 0 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))) (.cse89 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_56 Int)) (let ((.cse153 (select .cse7 v_prenex_1))) (let ((.cse155 (store (store .cse8 .cse153 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)))) (let ((.cse154 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse155 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse153 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse153) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse154 v_arrayElimCell_56) 0) (not (= .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse153 0)) (= (select .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse155 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)))))))) (.cse94 (and (or (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse150 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse149 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse150 1))) (and (= (select .cse149 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse149 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse150 1) v_arrayElimCell_56 0)) (not (= 0 .cse150)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse150))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse152 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse151 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse152 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse151 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse151 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse152 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse152)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse152)))))) .cse93)) (.cse95 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse148 (select .cse7 v_prenex_1))) (and (not (= .cse40 .cse148)) (not (= .cse148 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (.cse78 (exists ((v_prenex_1 Int)) (not (= .cse40 (select .cse7 v_prenex_1))))) (.cse139 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse147 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse147 1))) (and (= (select .cse146 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse146 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse147 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse147)))))) (.cse41 (store .cse8 .cse40 1)) (.cse46 (not .cse36)) (.cse47 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse40) 0)) (.cse140 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_2 Int)) (let ((.cse145 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse40 1))) (and (= |c_#valid| (store .cse42 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse145 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2))))) (.cse77 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= (select .cse7 v_prenex_1) (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))) (or (and (or .cse2 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_15 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse3 (select .cse7 v_prenex_1))) (let ((.cse5 (store .cse8 .cse3 1))) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse5 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse3 1)) (.cse6 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse3) 0) (= (select .cse4 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse5 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse6)) (not (= .cse3 .cse6))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_12 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse10 (select .cse7 v_prenex_1))) (let ((.cse11 (store .cse8 .cse10 1))) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse11 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse10 1))) (and (= (select .cse9 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse10) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse11 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse10 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse12 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse14 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse13 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse14 1))) (and (= (select .cse13 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse14 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse14) (not (= (select .cse7 v_prenex_1) .cse14))))))) .cse1) (and (or .cse15 .cse16 (exists ((v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_51 Int)) (let ((.cse19 (select |c_#valid| v_arrayElimCell_58)) (.cse17 (select .cse7 v_prenex_1))) (let ((.cse18 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_51) .cse17 1) v_arrayElimCell_58 .cse19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse17) 0) (= (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse17 1) v_arrayElimCell_58 .cse19) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse18 v_arrayElimCell_58) 0) (not (= .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse17 0)) (not (= .cse17 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_55 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse20 (select .cse7 v_prenex_1))) (let ((.cse21 (store .cse8 .cse20 1))) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse21 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse20 1)) (.cse23 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse20) 0) (not (= .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse20 0)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse22 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= 0 .cse23)) (not (= .cse20 .cse23))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_52 Int)) (let ((.cse24 (select .cse7 v_prenex_1))) (let ((.cse26 (store .cse8 .cse24 1))) (let ((.cse25 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse26 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse24 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse24) 0) (= (select .cse25 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse25 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse24 0)) (= |c_#valid| (store .cse26 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse24 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse27 .cse28 (exists ((v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_54 Int)) (let ((.cse30 (select |c_#valid| v_arrayElimCell_58)) (.cse29 (select .cse7 v_prenex_1))) (let ((.cse32 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)) (.cse31 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_54) .cse29 1) v_arrayElimCell_58 .cse30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse29 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse29) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse29 1) v_arrayElimCell_58 .cse30) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse29 0)) (= (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse32)) (not (= .cse29 .cse32)) (= (select .cse31 v_arrayElimCell_58) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse34 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse34 1)) (.cse35 (select .cse7 v_prenex_1))) (and (= (select .cse33 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse33 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse34 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse35 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse34) (not (= .cse35 .cse34))))))) .cse1) (and .cse0 (let ((.cse71 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int)) (let ((.cse128 (select .cse7 v_prenex_1))) (let ((.cse129 (store (store .cse8 .cse128 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)))) (let ((.cse127 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse128 1))) (and (= (select .cse127 v_arrayElimCell_57) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse128) 0) (= (select .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse128 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse129 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)))))))) (.cse72 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse126 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse125 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse126 1))) (and (= v_DerPreprocessor_3 (select .cse125 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse125 v_arrayElimCell_57) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse126 1) v_arrayElimCell_57 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse126)))))) (.cse73 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse124 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse123 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse124 1))) (and (= v_DerPreprocessor_3 (select .cse123 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (= (select .cse123 v_arrayElimCell_57) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse124 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse124)))))) (.cse37 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_2 Int) (v_arrayElimCell_57 Int)) (let ((.cse121 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse40 1))) (and (= |c_#valid| (store (store .cse42 v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (= (select .cse121 v_arrayElimCell_57) 0) (= (select .cse121 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2)))) (exists ((v_prenex_2 Int) (v_arrayElimCell_57 Int)) (let ((.cse122 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse40 1))) (and (= (select .cse122 v_arrayElimCell_57) 0) (= (select .cse122 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2) (= |c_#valid| (store .cse42 v_arrayElimCell_57 0)))))))) (or (and (or (and .cse36 .cse37) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_57 Int)) (let ((.cse38 (store .cse41 v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)))) (let ((.cse39 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse38 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse40 1))) (and (= |c_#valid| (store .cse38 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (= (select .cse39 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse39 v_arrayElimCell_57) 0))))) (exists ((v_DerPreprocessor_44 Int) (v_arrayElimCell_57 Int)) (let ((.cse43 (select |c_#valid| v_arrayElimCell_57))) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_44) .cse40 1) v_arrayElimCell_57 .cse43) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse40 1))) (and (= |c_#valid| (store (store .cse42 v_arrayElimCell_57 .cse43) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= 1 (select .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse44 v_arrayElimCell_57) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_45 Int)) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse41 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse40 1))) (and (= (select .cse45 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (store .cse41 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|))))) .cse46)) .cse47) (and .cse1 (or .cse15 .cse16 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_25 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse48 (select .cse7 v_prenex_1))) (let ((.cse50 (store .cse8 .cse48 1))) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse50 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse48 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse48) 0) (= (select .cse49 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse48 0)) (= 1 (select .cse49 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse50 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse48 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse53 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse51 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse53 1)) (.cse52 (select .cse7 v_prenex_1))) (and (= v_DerPreprocessor_3 (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse52 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (= (select .cse51 v_arrayElimCell_57) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse53 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse53) (not (= .cse52 .cse53)))))) .cse27 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_23 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse54 (select .cse7 v_prenex_1))) (let ((.cse56 (store .cse8 .cse54 1))) (let ((.cse55 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse56 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse54 1)) (.cse57 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse54) 0) (= (select .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse55 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse54 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse54 0)) (= |c_#valid| (store .cse56 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse57)) (not (= .cse54 .cse57))))))) (exists ((v_DerPreprocessor_24 Int) (v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse60 (select |c_#valid| v_arrayElimCell_58)) (.cse58 (select .cse7 v_prenex_1))) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_24) .cse58 1) v_arrayElimCell_58 .cse60) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse58 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse58) 0) (= (select .cse59 v_arrayElimCell_58) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse58 1) v_arrayElimCell_58 .cse60) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse58 0)) (= (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse58 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) .cse28 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse63 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse63 1)) (.cse62 (select .cse7 v_prenex_1))) (and (= v_DerPreprocessor_3 (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse62 0)) (= (select .cse61 v_arrayElimCell_57) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse63 1) v_arrayElimCell_57 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse63) (not (= .cse62 .cse63)))))) (exists ((v_DerPreprocessor_22 Int) (v_prenex_1 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse65 (select |c_#valid| v_arrayElimCell_58)) (.cse64 (select .cse7 v_prenex_1))) (let ((.cse66 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_22) .cse64 1) v_arrayElimCell_58 .cse65) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1)) (.cse67 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse64) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse64 1) v_arrayElimCell_58 .cse65) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse64 0)) (= (select .cse66 v_arrayElimCell_58) 0) (= (select .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse67)) (not (= .cse64 .cse67)))))))) (and .cse1 (or (exists ((v_prenex_1 Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_40 Int)) (let ((.cse69 (select |c_#valid| v_arrayElimCell_57)) (.cse68 (select .cse7 v_prenex_1))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_40) .cse68 1) v_arrayElimCell_57 .cse69) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse68 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse68) 0) (not (= .cse68 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse68 1) v_arrayElimCell_57 .cse69) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse70 v_arrayElimCell_57) 0) (= (select .cse70 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse71 .cse72 .cse73 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_41 Int)) (let ((.cse74 (select .cse7 v_prenex_1))) (let ((.cse76 (store .cse8 .cse74 1))) (let ((.cse75 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse76 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse74 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse74) 0) (= (select .cse75 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse75 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse74 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse76 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))))) (and .cse36 .cse77 .cse37) (and .cse78 .cse36 .cse37) (and (or .cse71 (exists ((v_DerPreprocessor_35 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int)) (let ((.cse79 (select .cse7 v_prenex_1))) (let ((.cse81 (store .cse8 .cse79 1))) (let ((.cse80 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse81 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse79 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse79) 0) (= (select .cse80 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse80 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse79 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse81 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) (and .cse82 (or (exists ((v_DerPreprocessor_36 Int) (v_prenex_1 Int) (v_arrayElimCell_56 Int)) (let ((.cse84 (select |c_#valid| v_arrayElimCell_56)) (.cse83 (select .cse7 v_prenex_1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_36) .cse83 1) v_arrayElimCell_56 .cse84) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse83 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse83) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse83 1) v_arrayElimCell_56 .cse84) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse83 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse83 0)) (= (select .cse85 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse85 v_arrayElimCell_56) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_37 Int) (v_prenex_1 Int)) (let ((.cse86 (select .cse7 v_prenex_1))) (let ((.cse88 (store .cse8 .cse86 1))) (let ((.cse87 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse88 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse86 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse86) 0) (= (select .cse87 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse87 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse86 0)) (= |c_#valid| (store .cse88 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) .cse89)) (exists ((v_DerPreprocessor_34 Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int)) (let ((.cse92 (select |c_#valid| v_arrayElimCell_57)) (.cse90 (select .cse7 v_prenex_1))) (let ((.cse91 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_34) .cse90 1) v_arrayElimCell_57 .cse92) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse90 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse90) 0) (= (select .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse91 v_arrayElimCell_57) 0) (not (= .cse90 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse90 1) v_arrayElimCell_57 .cse92) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (and (or .cse72 .cse73) .cse93) .cse94) .cse1) (and .cse36 .cse95 .cse37) (and (or (exists ((v_DerPreprocessor_29 Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse98 (select |c_#valid| v_arrayElimCell_57)) (.cse97 (select .cse7 v_prenex_1))) (let ((.cse96 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_29) .cse97 1) v_arrayElimCell_57 .cse98) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse97 1)) (.cse99 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select .cse96 v_arrayElimCell_57) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse97) 0) (not (= .cse97 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse97 1) v_arrayElimCell_57 .cse98) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse99)) (not (= .cse97 .cse99)))))) (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse101 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse100 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse101 1))) (and (= v_DerPreprocessor_3 (select .cse100 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse100 v_arrayElimCell_57) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse101 1) v_arrayElimCell_57 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse101) (not (= (select .cse7 v_prenex_1) .cse101)))))) .cse2 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_28 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse102 (select .cse7 v_prenex_1))) (let ((.cse104 (store .cse8 .cse102 1))) (let ((.cse103 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse104 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse102 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse102) 0) (= (select .cse103 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse102 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse104 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse103 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse102 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_30 Int)) (let ((.cse105 (select .cse7 v_prenex_1))) (let ((.cse107 (store .cse8 .cse105 1))) (let ((.cse106 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse107 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse105 1)) (.cse108 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse105) 0) (not (= .cse105 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse106 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse107 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse106 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= 0 .cse108)) (not (= .cse105 .cse108))))))) (exists ((v_DerPreprocessor_27 Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse110 (select |c_#valid| v_arrayElimCell_57)) (.cse109 (select .cse7 v_prenex_1))) (let ((.cse111 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_27) .cse109 1) v_arrayElimCell_57 .cse110) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse109 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse109) 0) (not (= .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse109 1) v_arrayElimCell_57 .cse110) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse111 v_arrayElimCell_57) 0) (not (= .cse109 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= (select .cse111 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse12 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_57 Int) (v_DerPreprocessor_3 Int)) (let ((.cse113 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse112 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse113 1))) (and (= v_DerPreprocessor_3 (select .cse112 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (= (select .cse112 v_arrayElimCell_57) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse113 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse113) (not (= (select .cse7 v_prenex_1) .cse113)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse115 (select .cse7 v_prenex_1))) (let ((.cse116 (store (store .cse8 .cse115 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)))) (let ((.cse114 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse115 1))) (and (= (select .cse114 v_arrayElimCell_57) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse115) 0) (= (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse115 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse116 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (not (= .cse115 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse118 (select .cse7 v_prenex_1))) (let ((.cse119 (store (store .cse8 .cse118 1) v_arrayElimCell_57 (select |c_#valid| v_arrayElimCell_57)))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse119 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse118 1)) (.cse120 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select .cse117 v_arrayElimCell_57) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse118) 0) (= (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse119 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_57)) (not (= 0 .cse120)) (not (= .cse118 .cse120)))))))) .cse1)))) (and (or (and .cse82 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_7 Int)) (let ((.cse130 (select .cse7 v_prenex_1))) (let ((.cse132 (store .cse8 .cse130 1))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse132 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse130 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse130) 0) (not (= .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse130 0)) (= (select .cse131 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= |c_#valid| (store .cse132 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_1 Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_56 Int)) (let ((.cse134 (select |c_#valid| v_arrayElimCell_56)) (.cse133 (select .cse7 v_prenex_1))) (let ((.cse135 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse133 1) v_arrayElimCell_56 .cse134) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse133 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse133) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse133 1) v_arrayElimCell_56 .cse134) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse133 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse133 0)) (= (select .cse135 v_arrayElimCell_56) 0) (= (select .cse135 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse89)) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_5 Int)) (let ((.cse136 (select .cse7 v_prenex_1))) (let ((.cse138 (store .cse8 .cse136 1))) (let ((.cse137 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse138 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse136 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse136) 0) (= (select .cse137 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse136 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse137 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse138 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) (and .cse139 .cse93) .cse94) .cse1) (and .cse140 .cse36 .cse95) (and .cse78 .cse140 .cse36) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_19 Int)) (let ((.cse142 (select .cse7 v_prenex_1))) (let ((.cse143 (store .cse8 .cse142 1))) (let ((.cse141 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse143 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse142 1))) (and (= (select .cse141 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse142) 0) (not (= .cse142 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse141 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse143 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) .cse139) .cse1) (and (or (and .cse140 .cse36) (and (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_49 Int)) (let ((.cse144 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse41 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse40 1))) (and (= (store .cse41 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse144 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse46)) .cse47) (and .cse140 .cse36 .cse77)))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false