./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:49:44,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:49:44,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:49:44,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:49:44,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:49:44,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:49:44,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:49:44,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:49:44,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:49:44,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:49:44,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:49:44,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:49:44,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:49:44,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:49:44,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:49:44,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:49:44,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:49:44,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:49:44,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:49:44,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:49:44,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:49:44,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:49:44,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:49:44,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:49:44,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:49:44,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:49:44,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:49:44,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:49:44,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:49:44,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:49:44,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:49:44,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:49:44,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:49:44,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:49:44,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:49:44,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:49:44,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:49:44,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:49:44,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:49:44,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:49:44,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:49:44,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:49:44,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:49:44,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:49:44,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:49:44,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:49:44,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:49:44,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:49:44,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:49:44,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:49:44,920 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:49:44,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:49:44,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:49:44,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:49:44,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:49:44,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:49:44,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:49:44,922 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:49:44,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:49:44,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:49:44,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:49:44,928 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:49:44,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:49:44,928 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:49:44,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:49:44,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:49:44,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:49:44,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:49:44,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:49:44,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:49:44,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:49:44,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:49:44,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-11-16 11:49:45,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:49:45,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:49:45,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:49:45,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:49:45,336 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:49:45,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-16 11:49:45,418 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/data/04e41b218/267cab3c901049b6b427e0e2c8fb459c/FLAG7df800736 [2022-11-16 11:49:46,060 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:49:46,061 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-16 11:49:46,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/data/04e41b218/267cab3c901049b6b427e0e2c8fb459c/FLAG7df800736 [2022-11-16 11:49:46,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/data/04e41b218/267cab3c901049b6b427e0e2c8fb459c [2022-11-16 11:49:46,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:49:46,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:49:46,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:49:46,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:49:46,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:49:46,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:46" (1/1) ... [2022-11-16 11:49:46,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6014df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:46, skipping insertion in model container [2022-11-16 11:49:46,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:46" (1/1) ... [2022-11-16 11:49:46,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:49:46,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:49:47,029 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-16 11:49:47,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:49:47,058 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:49:47,104 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-16 11:49:47,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:49:47,137 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:49:47,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47 WrapperNode [2022-11-16 11:49:47,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:49:47,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:49:47,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:49:47,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:49:47,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,208 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-11-16 11:49:47,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:49:47,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:49:47,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:49:47,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:49:47,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:49:47,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:49:47,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:49:47,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:49:47,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (1/1) ... [2022-11-16 11:49:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:49:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:47,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:49:47,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:49:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:49:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:49:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:49:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:49:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:49:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:49:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:49:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:49:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:49:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:49:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:49:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:49:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:49:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:49:47,573 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:49:47,575 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:49:48,297 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:49:48,307 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:49:48,307 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:49:48,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:49:48 BoogieIcfgContainer [2022-11-16 11:49:48,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:49:48,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:49:48,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:49:48,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:49:48,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:49:46" (1/3) ... [2022-11-16 11:49:48,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbe5574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:48, skipping insertion in model container [2022-11-16 11:49:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:47" (2/3) ... [2022-11-16 11:49:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbe5574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:48, skipping insertion in model container [2022-11-16 11:49:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:49:48" (3/3) ... [2022-11-16 11:49:48,329 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-11-16 11:49:48,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:49:48,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-16 11:49:48,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:49:48,436 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bfb768f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:49:48,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-11-16 11:49:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:49:48,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:48,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:48,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-11-16 11:49:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:48,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088555828] [2022-11-16 11:49:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:48,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088555828] [2022-11-16 11:49:48,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088555828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:48,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:48,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:49:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157044538] [2022-11-16 11:49:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:48,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:49:48,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:49:48,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:49:48,997 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:49,247 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-16 11:49:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:49:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 11:49:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:49,263 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:49:49,263 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:49:49,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:49:49,274 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:49,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:49:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:49:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-16 11:49:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-11-16 11:49:49,349 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-11-16 11:49:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:49,349 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-11-16 11:49:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-11-16 11:49:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:49:49,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:49,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:49:49,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-11-16 11:49:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642164739] [2022-11-16 11:49:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642164739] [2022-11-16 11:49:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642164739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:49:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987909019] [2022-11-16 11:49:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:49,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:49:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:49:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:49:49,577 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:49,693 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-16 11:49:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:49:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 11:49:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:49,696 INFO L225 Difference]: With dead ends: 99 [2022-11-16 11:49:49,696 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 11:49:49,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:49:49,698 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:49,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:49:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 11:49:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-16 11:49:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-16 11:49:49,720 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-11-16 11:49:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:49,720 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-16 11:49:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-16 11:49:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:49:49,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:49,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:49,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:49:49,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-11-16 11:49:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338235961] [2022-11-16 11:49:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:50,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338235961] [2022-11-16 11:49:50,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338235961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:50,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:50,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:49:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261646978] [2022-11-16 11:49:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:50,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:49:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:49:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:49:50,482 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:50,986 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-11-16 11:49:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:49:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-16 11:49:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:50,990 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:49:50,990 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:49:50,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:49:50,992 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:50,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 476 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:49:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:49:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-16 11:49:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-16 11:49:51,006 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-11-16 11:49:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:51,006 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-16 11:49:51,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-16 11:49:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:49:51,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:51,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:51,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:49:51,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-11-16 11:49:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:51,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851357553] [2022-11-16 11:49:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:51,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:51,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851357553] [2022-11-16 11:49:51,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851357553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:51,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:51,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:49:51,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551776153] [2022-11-16 11:49:51,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:51,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:49:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:49:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:49:51,190 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:51,584 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-16 11:49:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:49:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-16 11:49:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:51,586 INFO L225 Difference]: With dead ends: 100 [2022-11-16 11:49:51,586 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 11:49:51,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:49:51,588 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:51,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:49:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 11:49:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-16 11:49:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-11-16 11:49:51,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-11-16 11:49:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:51,607 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-11-16 11:49:51,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-11-16 11:49:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:49:51,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:51,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:51,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:49:51,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-11-16 11:49:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838261349] [2022-11-16 11:49:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:49:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838261349] [2022-11-16 11:49:51,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838261349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:51,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:51,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:49:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284789696] [2022-11-16 11:49:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:51,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:49:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:49:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:49:51,769 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:51,928 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-16 11:49:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:49:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-16 11:49:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:51,935 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:49:51,936 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:49:51,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:49:51,942 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:51,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:49:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:49:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-11-16 11:49:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:49:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-11-16 11:49:51,970 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-11-16 11:49:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-11-16 11:49:51,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-11-16 11:49:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:49:51,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:51,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:49:51,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-11-16 11:49:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:51,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13520460] [2022-11-16 11:49:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:52,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13520460] [2022-11-16 11:49:52,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13520460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:49:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:49:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:49:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702366658] [2022-11-16 11:49:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:49:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:49:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:49:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:49:52,118 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:52,276 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-16 11:49:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:49:52,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-16 11:49:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:52,278 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:49:52,278 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:49:52,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:49:52,279 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:52,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:49:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:49:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-16 11:49:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:49:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-16 11:49:52,286 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-11-16 11:49:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:52,287 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-16 11:49:52,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:49:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-16 11:49:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:49:52,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:52,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:49:52,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-11-16 11:49:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808775055] [2022-11-16 11:49:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:49:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:49:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:52,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808775055] [2022-11-16 11:49:52,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808775055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:52,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016653260] [2022-11-16 11:49:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:52,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:52,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:52,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:49:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:52,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:49:52,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:52,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:49:52,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016653260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:52,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:52,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-16 11:49:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519960260] [2022-11-16 11:49:52,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:49:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:49:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:49:52,892 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:49:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:53,059 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-11-16 11:49:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:49:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-11-16 11:49:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:53,061 INFO L225 Difference]: With dead ends: 103 [2022-11-16 11:49:53,061 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 11:49:53,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:49:53,063 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 14 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:53,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 428 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:49:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 11:49:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-16 11:49:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:49:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-11-16 11:49:53,081 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-11-16 11:49:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:53,082 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-11-16 11:49:53,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:49:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-11-16 11:49:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:49:53,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:53,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:53,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:53,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:53,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-11-16 11:49:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306244611] [2022-11-16 11:49:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:49:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:49:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306244611] [2022-11-16 11:49:53,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306244611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783241853] [2022-11-16 11:49:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:53,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:53,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:49:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:54,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:49:54,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:54,080 INFO L350 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 [2022-11-16 11:49:54,196 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:49:54,296 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:54,297 INFO L350 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 [2022-11-16 11:49:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:49:54,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:54,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783241853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:54,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:49:54,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-11-16 11:49:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559977157] [2022-11-16 11:49:54,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:54,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:49:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:49:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-11-16 11:49:54,442 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:49:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:54,996 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-16 11:49:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:49:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-16 11:49:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:54,998 INFO L225 Difference]: With dead ends: 114 [2022-11-16 11:49:54,998 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 11:49:54,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-11-16 11:49:55,000 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:55,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 329 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 117 Unchecked, 0.4s Time] [2022-11-16 11:49:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 11:49:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-16 11:49:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:49:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-11-16 11:49:55,006 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-11-16 11:49:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:55,007 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-11-16 11:49:55,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:49:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-11-16 11:49:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:49:55,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:55,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:55,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:55,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 11:49:55,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:49:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-11-16 11:49:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313532667] [2022-11-16 11:49:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:49:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:49:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313532667] [2022-11-16 11:49:56,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313532667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:56,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194465454] [2022-11-16 11:49:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:56,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:56,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:56,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:56,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:49:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:56,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:49:56,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:56,382 INFO L350 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 [2022-11-16 11:49:56,391 INFO L350 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 [2022-11-16 11:49:56,622 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:49:56,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:56,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:49:56,740 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:56,740 INFO L350 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 [2022-11-16 11:49:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:49:56,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:03,058 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:50:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194465454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:03,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2022-11-16 11:50:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158152518] [2022-11-16 11:50:03,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:50:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:50:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2022-11-16 11:50:03,062 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:03,832 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-16 11:50:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:50:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-16 11:50:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:03,834 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:50:03,834 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:50:03,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2022-11-16 11:50:03,835 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:03,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 344 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2022-11-16 11:50:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:50:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-16 11:50:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-16 11:50:03,841 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-11-16 11:50:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:03,842 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-16 11:50:03,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-16 11:50:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:50:03,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:03,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:03,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:04,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:04,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-11-16 11:50:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:04,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115505251] [2022-11-16 11:50:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:50:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:50:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:04,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115505251] [2022-11-16 11:50:04,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115505251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:04,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617891806] [2022-11-16 11:50:04,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:04,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:04,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:04,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:50:04,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:04,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:50:04,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:50:04,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:50:04,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617891806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:04,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:04,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-11-16 11:50:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782996621] [2022-11-16 11:50:04,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:50:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:50:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:50:04,974 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:50:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:05,268 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-11-16 11:50:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:50:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-11-16 11:50:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:05,270 INFO L225 Difference]: With dead ends: 101 [2022-11-16 11:50:05,270 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 11:50:05,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:50:05,272 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:05,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 411 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:50:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 11:50:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-16 11:50:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-16 11:50:05,280 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-11-16 11:50:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:05,280 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-16 11:50:05,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:50:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-16 11:50:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:50:05,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:05,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:05,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:05,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:50:05,487 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-11-16 11:50:05,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:05,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529000402] [2022-11-16 11:50:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:50:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529000402] [2022-11-16 11:50:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529000402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483221810] [2022-11-16 11:50:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:06,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:06,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:50:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:06,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:50:06,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:06,636 INFO L350 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 [2022-11-16 11:50:06,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:50:06,692 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1169 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1169))))) is different from true [2022-11-16 11:50:06,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:06,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:06,817 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 11:50:06,859 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:06,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:06,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:06,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 14 not checked. [2022-11-16 11:50:06,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:07,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483221810] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:07,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:07,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2022-11-16 11:50:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112194958] [2022-11-16 11:50:07,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:07,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:50:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:50:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2022-11-16 11:50:07,484 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:50:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:08,060 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-11-16 11:50:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:50:08,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-11-16 11:50:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:08,062 INFO L225 Difference]: With dead ends: 109 [2022-11-16 11:50:08,062 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 11:50:08,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=213, Unknown=2, NotChecked=62, Total=342 [2022-11-16 11:50:08,063 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:08,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 352 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 211 Unchecked, 0.4s Time] [2022-11-16 11:50:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 11:50:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-11-16 11:50:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-16 11:50:08,068 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 47 [2022-11-16 11:50:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:08,068 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-16 11:50:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:50:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-16 11:50:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:50:08,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:08,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:08,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:08,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:08,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:08,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2022-11-16 11:50:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:08,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671870910] [2022-11-16 11:50:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:50:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:09,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671870910] [2022-11-16 11:50:09,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671870910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593185208] [2022-11-16 11:50:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:09,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:09,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:09,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:50:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:09,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:50:09,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:09,752 INFO L350 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 [2022-11-16 11:50:09,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:50:09,811 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1422 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1422) |c_#length|)))) is different from true [2022-11-16 11:50:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:09,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:09,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:50:09,944 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1423 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1423))))) is different from true [2022-11-16 11:50:10,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:10,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:10,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:50:10,123 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1424 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1424))))) is different from true [2022-11-16 11:50:10,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:10,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:50:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-11-16 11:50:10,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593185208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:10,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:10,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-16 11:50:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687599791] [2022-11-16 11:50:10,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:10,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:50:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:10,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:50:10,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-16 11:50:10,341 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:50:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:10,923 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-11-16 11:50:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:50:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-11-16 11:50:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:10,925 INFO L225 Difference]: With dead ends: 104 [2022-11-16 11:50:10,925 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 11:50:10,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-16 11:50:10,926 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 254 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:10,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 228 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 321 Invalid, 0 Unknown, 306 Unchecked, 0.5s Time] [2022-11-16 11:50:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 11:50:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-11-16 11:50:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.532258064516129) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-11-16 11:50:10,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2022-11-16 11:50:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:10,933 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-11-16 11:50:10,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:50:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-11-16 11:50:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:50:10,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:10,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:10,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:11,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:11,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2022-11-16 11:50:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:11,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212470038] [2022-11-16 11:50:11,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:50:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:12,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212470038] [2022-11-16 11:50:12,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212470038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872025279] [2022-11-16 11:50:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:12,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:12,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:50:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:12,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 11:50:12,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:12,853 INFO L350 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 [2022-11-16 11:50:13,178 INFO L350 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 9 treesize of output 5 [2022-11-16 11:50:13,423 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1676 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1676) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 11:50:13,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:13,466 INFO L350 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 16 treesize of output 18 [2022-11-16 11:50:13,496 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:50:13,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:50:13,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:50:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:50:13,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:13,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872025279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:13,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:13,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-16 11:50:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976196267] [2022-11-16 11:50:13,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:50:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:50:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=653, Unknown=21, NotChecked=52, Total=812 [2022-11-16 11:50:13,916 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:15,321 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-11-16 11:50:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:50:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 11:50:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:15,323 INFO L225 Difference]: With dead ends: 133 [2022-11-16 11:50:15,323 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 11:50:15,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=964, Unknown=24, NotChecked=64, Total=1190 [2022-11-16 11:50:15,325 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:15,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1139 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 918 Invalid, 0 Unknown, 160 Unchecked, 1.0s Time] [2022-11-16 11:50:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 11:50:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2022-11-16 11:50:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.507936507936508) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-16 11:50:15,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 51 [2022-11-16 11:50:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:15,331 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-16 11:50:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-16 11:50:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:50:15,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:15,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:15,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 11:50:15,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:15,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2022-11-16 11:50:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753605107] [2022-11-16 11:50:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:50:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:17,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753605107] [2022-11-16 11:50:17,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753605107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:17,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849791131] [2022-11-16 11:50:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:17,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:17,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:50:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:18,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-16 11:50:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:18,421 INFO L350 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 [2022-11-16 11:50:19,109 INFO L350 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 19 treesize of output 11 [2022-11-16 11:50:19,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:50:19,526 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1934 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1934))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1933 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1933) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1928 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1928) |c_#length|)))) is different from true [2022-11-16 11:50:19,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:19,594 INFO L350 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 14 treesize of output 16 [2022-11-16 11:50:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:19,635 INFO L350 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 25 treesize of output 25 [2022-11-16 11:50:19,653 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:50:19,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 11:50:19,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:50:19,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:50:19,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:50:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:50:19,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:20,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849791131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:20,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:20,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-11-16 11:50:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820294395] [2022-11-16 11:50:20,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:50:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:50:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2022-11-16 11:50:20,435 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:23,493 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-11-16 11:50:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:50:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 11:50:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:23,495 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:50:23,495 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 11:50:23,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=210, Invalid=2045, Unknown=5, NotChecked=92, Total=2352 [2022-11-16 11:50:23,497 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 266 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:23,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1736 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1372 Invalid, 0 Unknown, 189 Unchecked, 1.7s Time] [2022-11-16 11:50:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 11:50:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-16 11:50:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-16 11:50:23,502 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 51 [2022-11-16 11:50:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:23,503 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-16 11:50:23,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-16 11:50:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:50:23,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:23,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:23,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 11:50:23,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:50:23,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1941832962, now seen corresponding path program 1 times [2022-11-16 11:50:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624097175] [2022-11-16 11:50:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 11:50:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:23,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624097175] [2022-11-16 11:50:23,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624097175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:23,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:23,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409592222] [2022-11-16 11:50:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:23,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:23,932 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:24,091 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-16 11:50:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-11-16 11:50:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:24,093 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:50:24,093 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:50:24,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:24,094 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:24,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 157 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:50:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:50:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2022-11-16 11:50:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-11-16 11:50:24,099 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2022-11-16 11:50:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:24,099 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-11-16 11:50:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-11-16 11:50:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:50:24,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:24,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:50:24,101 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2022-11-16 11:50:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:24,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022947047] [2022-11-16 11:50:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:50:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:24,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022947047] [2022-11-16 11:50:24,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022947047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:24,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:24,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:50:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43607391] [2022-11-16 11:50:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:24,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:50:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:50:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:50:24,601 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:25,054 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-16 11:50:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:50:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-16 11:50:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:25,056 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:50:25,056 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 11:50:25,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:50:25,057 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 225 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:25,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 356 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:50:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 11:50:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-16 11:50:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.408450704225352) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-11-16 11:50:25,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2022-11-16 11:50:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:25,062 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-11-16 11:50:25,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-11-16 11:50:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:50:25,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:25,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:50:25,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2022-11-16 11:50:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:25,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739670512] [2022-11-16 11:50:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:50:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:25,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739670512] [2022-11-16 11:50:25,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739670512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:25,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:50:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698402270] [2022-11-16 11:50:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:25,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:50:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:50:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:50:25,930 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:26,498 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-11-16 11:50:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:50:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-16 11:50:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:26,504 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:50:26,504 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:50:26,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:50:26,505 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 194 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:26,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 398 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:50:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:50:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2022-11-16 11:50:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-11-16 11:50:26,517 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-11-16 11:50:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:26,517 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-11-16 11:50:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:50:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-11-16 11:50:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:50:26,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:26,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:26,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:50:26,523 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2022-11-16 11:50:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:26,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713591718] [2022-11-16 11:50:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:28,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:50:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713591718] [2022-11-16 11:50:29,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713591718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:29,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132148338] [2022-11-16 11:50:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:29,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:29,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:50:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:30,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 11:50:30,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:30,253 INFO L350 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 [2022-11-16 11:50:30,745 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:30,746 INFO L350 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 [2022-11-16 11:50:30,976 INFO L350 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 13 treesize of output 9 [2022-11-16 11:50:31,112 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:31,113 INFO L350 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 34 treesize of output 35 [2022-11-16 11:50:31,589 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-16 11:50:31,590 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2022-11-16 11:50:31,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:50:31,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:50:31,978 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2677 (Array Int Int)) (v_ArrVal_2676 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2676) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2677) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:50:32,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,076 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:50:32,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-16 11:50:32,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,087 INFO L350 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 48 treesize of output 48 [2022-11-16 11:50:32,137 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-11-16 11:50:32,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2022-11-16 11:50:32,289 INFO L350 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 49 treesize of output 37 [2022-11-16 11:50:32,585 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-16 11:50:32,586 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-11-16 11:50:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:50:32,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:33,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132148338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:33,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:33,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-16 11:50:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277807146] [2022-11-16 11:50:33,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:33,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:50:33,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:50:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2366, Unknown=1, NotChecked=98, Total=2652 [2022-11-16 11:50:33,249 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:35,702 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-11-16 11:50:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:50:35,705 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-11-16 11:50:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:35,707 INFO L225 Difference]: With dead ends: 103 [2022-11-16 11:50:35,707 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 11:50:35,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=338, Invalid=3697, Unknown=1, NotChecked=124, Total=4160 [2022-11-16 11:50:35,709 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 80 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:35,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1145 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1028 Invalid, 0 Unknown, 177 Unchecked, 1.2s Time] [2022-11-16 11:50:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 11:50:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-11-16 11:50:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3875) internal successors, (111), 97 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-16 11:50:35,730 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2022-11-16 11:50:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:35,731 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-16 11:50:35,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-16 11:50:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:50:35,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:35,733 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:35,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:35,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:50:35,942 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2022-11-16 11:50:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:35,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225335991] [2022-11-16 11:50:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:50:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225335991] [2022-11-16 11:50:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225335991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420203069] [2022-11-16 11:50:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:40,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:40,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:40,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:50:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:41,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 11:50:41,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:41,154 INFO L350 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 [2022-11-16 11:50:41,877 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:41,877 INFO L350 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 [2022-11-16 11:50:42,136 INFO L350 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 13 treesize of output 9 [2022-11-16 11:50:42,159 INFO L350 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 13 treesize of output 9 [2022-11-16 11:50:42,355 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:42,355 INFO L350 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 65 treesize of output 62 [2022-11-16 11:50:42,369 INFO L350 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 41 treesize of output 41 [2022-11-16 11:50:42,973 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:50:42,973 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 48 [2022-11-16 11:50:42,995 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:50:42,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-11-16 11:50:43,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:50:43,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:50:43,482 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2948 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2948))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2943 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2943) |c_#length|)) (exists ((v_ArrVal_2949 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2949))))) is different from true [2022-11-16 11:50:43,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:43,569 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:50:43,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 97 [2022-11-16 11:50:43,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:43,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:43,586 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:50:43,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-11-16 11:50:43,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:43,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-16 11:50:43,637 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:50:43,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:50:44,153 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:50:44,153 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-11-16 11:50:44,172 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:50:44,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-16 11:50:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:50:44,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:45,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420203069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:45,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:45,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-16 11:50:45,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010164960] [2022-11-16 11:50:45,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:45,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 11:50:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 11:50:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3013, Unknown=3, NotChecked=110, Total=3306 [2022-11-16 11:50:45,191 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:51,518 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2022-11-16 11:50:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:50:51,518 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-11-16 11:50:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:51,520 INFO L225 Difference]: With dead ends: 196 [2022-11-16 11:50:51,520 INFO L226 Difference]: Without dead ends: 196 [2022-11-16 11:50:51,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=439, Invalid=5112, Unknown=3, NotChecked=146, Total=5700 [2022-11-16 11:50:51,523 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 605 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 434 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:51,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1958 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2478 Invalid, 0 Unknown, 434 Unchecked, 3.0s Time] [2022-11-16 11:50:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-16 11:50:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 104. [2022-11-16 11:50:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 99 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-11-16 11:50:51,529 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2022-11-16 11:50:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-11-16 11:50:51,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-11-16 11:50:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 11:50:51,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:51,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:51,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:51,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:51,739 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2022-11-16 11:50:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713407188] [2022-11-16 11:50:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:50:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:52,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713407188] [2022-11-16 11:50:52,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713407188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:52,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638561248] [2022-11-16 11:50:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:52,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:52,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:52,631 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:52,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:50:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:53,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 11:50:53,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:53,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:50:53,681 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3221 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3221)))) is different from true [2022-11-16 11:50:53,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:53,711 INFO L350 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 24 treesize of output 24 [2022-11-16 11:50:53,769 INFO L350 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 25 treesize of output 13 [2022-11-16 11:50:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:50:53,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:54,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638561248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:54,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:54,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-16 11:50:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641223384] [2022-11-16 11:50:54,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:54,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:50:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:50:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2022-11-16 11:50:54,003 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:55,143 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-16 11:50:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:50:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-16 11:50:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:55,144 INFO L225 Difference]: With dead ends: 92 [2022-11-16 11:50:55,145 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 11:50:55,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=4, NotChecked=66, Total=1260 [2022-11-16 11:50:55,146 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 695 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 87 Unchecked, 0.7s Time] [2022-11-16 11:50:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 11:50:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 11:50:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-11-16 11:50:55,150 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2022-11-16 11:50:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:55,151 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-11-16 11:50:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:50:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-11-16 11:50:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:50:55,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:55,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:55,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:55,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-16 11:50:55,361 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2022-11-16 11:50:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:55,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132310578] [2022-11-16 11:50:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:50:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:56,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132310578] [2022-11-16 11:50:56,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132310578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:56,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:56,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-16 11:50:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194993825] [2022-11-16 11:50:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:56,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:50:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:50:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:50:56,690 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:58,387 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-11-16 11:50:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:50:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-16 11:50:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:58,390 INFO L225 Difference]: With dead ends: 157 [2022-11-16 11:50:58,390 INFO L226 Difference]: Without dead ends: 157 [2022-11-16 11:50:58,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 11:50:58,391 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 804 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:58,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 488 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 11:50:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-16 11:50:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2022-11-16 11:50:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-16 11:50:58,397 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2022-11-16 11:50:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:58,398 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-16 11:50:58,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-16 11:50:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:50:58,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:58,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:58,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:50:58,400 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:50:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2022-11-16 11:50:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:58,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807325725] [2022-11-16 11:50:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:51:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807325725] [2022-11-16 11:51:00,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807325725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509381960] [2022-11-16 11:51:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:00,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:00,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:00,828 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:00,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:51:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:01,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-16 11:51:01,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:01,291 INFO L350 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 [2022-11-16 11:51:01,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:51:01,551 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:01,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:51:01,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:51:02,019 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:02,019 INFO L350 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 [2022-11-16 11:51:02,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:51:02,551 INFO L350 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 [2022-11-16 11:51:02,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:02,954 INFO L350 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 17 treesize of output 12 [2022-11-16 11:51:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:02,971 INFO L350 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 16 treesize of output 11 [2022-11-16 11:51:03,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:03,626 INFO L350 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 44 treesize of output 43 [2022-11-16 11:51:03,631 INFO L350 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 33 treesize of output 33 [2022-11-16 11:51:03,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:03,749 INFO L350 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 30 [2022-11-16 11:51:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:03,762 INFO L350 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 29 treesize of output 29 [2022-11-16 11:51:03,913 INFO L350 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 19 [2022-11-16 11:51:03,917 INFO L350 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 26 treesize of output 14 [2022-11-16 11:51:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:03,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:04,224 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-16 11:51:04,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:04,538 INFO L350 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 52 treesize of output 56 [2022-11-16 11:51:04,596 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1))) (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 11:51:04,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_prenex_8) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-16 11:51:04,946 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3667) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_8) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3668) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-16 11:51:05,084 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3679 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3679))) (< (select (select (store (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_prenex_8) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1)))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3679 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3679) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_3668) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= .cse1 (select (select (store (store .cse2 .cse1 v_ArrVal_3667) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 11:51:05,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509381960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:05,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:05,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2022-11-16 11:51:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683166099] [2022-11-16 11:51:05,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:05,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:51:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:51:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2299, Unknown=15, NotChecked=500, Total=2970 [2022-11-16 11:51:05,092 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:51:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:09,120 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2022-11-16 11:51:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:51:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-16 11:51:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:09,122 INFO L225 Difference]: With dead ends: 192 [2022-11-16 11:51:09,122 INFO L226 Difference]: Without dead ends: 192 [2022-11-16 11:51:09,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=544, Invalid=4291, Unknown=15, NotChecked=700, Total=5550 [2022-11-16 11:51:09,130 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1508 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:09,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 925 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-16 11:51:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-16 11:51:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 105. [2022-11-16 11:51:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-16 11:51:09,136 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2022-11-16 11:51:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:09,137 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-16 11:51:09,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:51:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-16 11:51:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:51:09,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:09,138 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:09,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 11:51:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:09,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:51:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2022-11-16 11:51:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:09,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822656222] [2022-11-16 11:51:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:51:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:51:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822656222] [2022-11-16 11:51:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822656222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324626930] [2022-11-16 11:51:14,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:51:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:14,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:14,888 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:14,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:51:15,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:51:15,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:51:15,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-16 11:51:15,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:15,428 INFO L350 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 [2022-11-16 11:51:15,757 INFO L350 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 [2022-11-16 11:51:15,769 INFO L350 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 [2022-11-16 11:51:16,729 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:16,730 INFO L350 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 [2022-11-16 11:51:16,742 INFO L350 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 14 treesize of output 16 [2022-11-16 11:51:16,757 INFO L350 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 14 treesize of output 16 [2022-11-16 11:51:17,025 INFO L350 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 14 treesize of output 16 [2022-11-16 11:51:17,041 INFO L350 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 14 treesize of output 16 [2022-11-16 11:51:17,187 INFO L350 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 21 treesize of output 20 [2022-11-16 11:51:17,205 INFO L350 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 21 treesize of output 20 [2022-11-16 11:51:17,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:17,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:17,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:17,421 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:51:17,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 73 [2022-11-16 11:51:17,443 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-16 11:51:17,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-16 11:51:18,176 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:51:18,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2022-11-16 11:51:18,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:51:18,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:18,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:51:18,532 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3950 (Array Int Int)) (v_ArrVal_3951 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3950)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3951)))) is different from true [2022-11-16 11:51:18,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:18,618 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:51:18,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2022-11-16 11:51:18,654 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:51:18,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:51:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:18,670 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-16 11:51:18,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-11-16 11:51:19,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:19,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:19,791 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-16 11:51:19,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-11-16 11:51:19,819 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-11-16 11:51:19,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-11-16 11:51:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 11:51:19,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:20,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324626930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:20,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-11-16 11:51:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144079980] [2022-11-16 11:51:20,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-16 11:51:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-16 11:51:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3484, Unknown=2, NotChecked=118, Total=3782 [2022-11-16 11:51:20,948 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:51:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:24,881 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-11-16 11:51:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:51:24,881 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-16 11:51:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:24,883 INFO L225 Difference]: With dead ends: 128 [2022-11-16 11:51:24,883 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 11:51:24,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=324, Invalid=5684, Unknown=2, NotChecked=152, Total=6162 [2022-11-16 11:51:24,884 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:24,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1597 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 269 Unchecked, 1.7s Time] [2022-11-16 11:51:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 11:51:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-11-16 11:51:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 120 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:51:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-11-16 11:51:24,891 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2022-11-16 11:51:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:24,891 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-11-16 11:51:24,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:51:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-11-16 11:51:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 11:51:24,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:24,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:24,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:25,103 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:51:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2022-11-16 11:51:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693201995] [2022-11-16 11:51:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:51:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:51:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:27,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693201995] [2022-11-16 11:51:27,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693201995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:27,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025353494] [2022-11-16 11:51:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:27,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:27,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:51:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:28,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-16 11:51:28,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:28,445 INFO L350 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 6 treesize of output 5 [2022-11-16 11:51:28,982 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:28,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:51:29,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:51:29,330 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:29,330 INFO L350 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 44 treesize of output 43 [2022-11-16 11:51:29,763 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-16 11:51:29,764 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2022-11-16 11:51:29,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:51:29,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:51:30,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:30,266 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:51:30,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-11-16 11:51:30,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:30,278 INFO L350 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 68 treesize of output 59 [2022-11-16 11:51:30,311 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:51:30,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:51:30,530 INFO L350 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 48 treesize of output 36 [2022-11-16 11:51:30,744 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-16 11:51:30,744 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2022-11-16 11:51:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:30,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:31,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| Int) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4250 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4249))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4250) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 11:51:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025353494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:31,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:31,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2022-11-16 11:51:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515815605] [2022-11-16 11:51:31,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:31,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:51:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:51:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2683, Unknown=1, NotChecked=104, Total=2970 [2022-11-16 11:51:31,122 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:51:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:35,214 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-11-16 11:51:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:51:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-11-16 11:51:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:35,217 INFO L225 Difference]: With dead ends: 114 [2022-11-16 11:51:35,217 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 11:51:35,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=468, Invalid=4791, Unknown=1, NotChecked=142, Total=5402 [2022-11-16 11:51:35,220 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 129 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:35,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1309 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1246 Invalid, 0 Unknown, 92 Unchecked, 1.4s Time] [2022-11-16 11:51:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 11:51:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-16 11:51:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:51:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-11-16 11:51:35,227 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2022-11-16 11:51:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:35,228 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-11-16 11:51:35,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:51:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-11-16 11:51:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 11:51:35,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:35,229 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:35,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:35,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 11:51:35,430 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:51:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2022-11-16 11:51:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:35,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279351508] [2022-11-16 11:51:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:51:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:51:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:51:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279351508] [2022-11-16 11:51:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279351508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429229037] [2022-11-16 11:51:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:37,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:37,352 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:37,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:51:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:37,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 11:51:37,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:37,982 INFO L350 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 6 treesize of output 5 [2022-11-16 11:51:38,553 INFO L350 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 18 treesize of output 10 [2022-11-16 11:51:39,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:39,142 INFO L350 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 24 treesize of output 24 [2022-11-16 11:51:39,171 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 11:51:39,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-16 11:51:40,058 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:51:40,058 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-16 11:51:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:40,080 INFO L350 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 32 treesize of output 30 [2022-11-16 11:51:40,172 INFO L350 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 25 treesize of output 13 [2022-11-16 11:51:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:40,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:44,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429229037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:44,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:44,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 50 [2022-11-16 11:51:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383453130] [2022-11-16 11:51:44,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:44,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:51:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:51:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3232, Unknown=54, NotChecked=0, Total=3540 [2022-11-16 11:51:44,232 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:51:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:49,941 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2022-11-16 11:51:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:51:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 62 [2022-11-16 11:51:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:49,943 INFO L225 Difference]: With dead ends: 153 [2022-11-16 11:51:49,944 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 11:51:49,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=601, Invalid=6142, Unknown=63, NotChecked=0, Total=6806 [2022-11-16 11:51:49,947 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 526 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:49,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 923 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1131 Invalid, 0 Unknown, 184 Unchecked, 1.2s Time] [2022-11-16 11:51:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 11:51:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2022-11-16 11:51:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.288888888888889) internal successors, (116), 106 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:51:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2022-11-16 11:51:49,953 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2022-11-16 11:51:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:49,953 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2022-11-16 11:51:49,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:51:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2022-11-16 11:51:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 11:51:49,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:49,955 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:49,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-16 11:51:50,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:51:50,164 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:51:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2022-11-16 11:51:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:50,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227559539] [2022-11-16 11:51:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:51:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:51:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:51:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:52,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227559539] [2022-11-16 11:51:52,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227559539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:52,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563046183] [2022-11-16 11:51:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:52,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:52,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:51:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-16 11:51:53,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:53,167 INFO L350 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 6 treesize of output 5 [2022-11-16 11:51:53,176 INFO L350 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 6 treesize of output 5 [2022-11-16 11:51:54,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-16 11:51:54,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:51:54,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:54,740 INFO L350 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 21 treesize of output 21 [2022-11-16 11:51:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:54,756 INFO L350 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 33 treesize of output 31 [2022-11-16 11:51:54,772 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:51:54,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 11:51:54,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:51:55,448 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:51:55,449 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-16 11:51:55,488 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:51:55,489 INFO L350 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 28 treesize of output 23 [2022-11-16 11:51:55,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:55,522 INFO L350 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 32 treesize of output 30 [2022-11-16 11:51:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:55,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-16 11:51:55,644 INFO L350 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 25 treesize of output 13 [2022-11-16 11:51:55,646 INFO L350 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 22 treesize of output 10 [2022-11-16 11:51:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:51:55,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:58,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563046183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:58,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:58,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 47 [2022-11-16 11:51:58,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53697817] [2022-11-16 11:51:58,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:58,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:51:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:58,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:51:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2955, Unknown=26, NotChecked=0, Total=3192 [2022-11-16 11:51:58,369 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:52:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:01,958 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2022-11-16 11:52:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:52:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 62 [2022-11-16 11:52:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:01,960 INFO L225 Difference]: With dead ends: 138 [2022-11-16 11:52:01,961 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:52:01,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=469, Invalid=5203, Unknown=28, NotChecked=0, Total=5700 [2022-11-16 11:52:01,964 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 533 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:01,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 910 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 96 Unchecked, 1.3s Time] [2022-11-16 11:52:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:52:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2022-11-16 11:52:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 110 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:52:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-16 11:52:01,970 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2022-11-16 11:52:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:01,970 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-16 11:52:01,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:52:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-16 11:52:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:52:01,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:01,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:01,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:02,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:52:02,179 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:52:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2022-11-16 11:52:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823759134] [2022-11-16 11:52:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:52:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:52:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:52:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823759134] [2022-11-16 11:52:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823759134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216146605] [2022-11-16 11:52:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:05,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:05,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:05,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:52:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:06,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-16 11:52:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:06,407 INFO L350 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 6 treesize of output 5 [2022-11-16 11:52:07,400 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:07,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:52:07,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-16 11:52:07,981 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:07,981 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-16 11:52:08,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:08,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-11-16 11:52:08,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:52:08,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:52:09,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:09,455 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:52:09,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 57 [2022-11-16 11:52:09,496 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:52:09,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:52:09,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:09,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-16 11:52:11,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:52:11,641 INFO L321 Elim1Store]: treesize reduction 124, result has 23.9 percent of original size [2022-11-16 11:52:11,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 95 [2022-11-16 11:52:11,685 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:52:11,685 INFO L350 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 74 treesize of output 54 [2022-11-16 11:52:11,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:11,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:52:11,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:11,922 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:52:11,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-11-16 11:52:12,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:52:12,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:12,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-16 11:52:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:52:12,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:12,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5115))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-11-16 11:52:12,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int)) (v_ArrVal_5113 Int) (v_ArrVal_5112 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_5112)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5115))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_5113)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2022-11-16 11:52:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216146605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:15,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:15,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-11-16 11:52:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560975923] [2022-11-16 11:52:15,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:15,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 11:52:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 11:52:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=5378, Unknown=6, NotChecked=298, Total=6006 [2022-11-16 11:52:15,419 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:52:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:27,845 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-11-16 11:52:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 11:52:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2022-11-16 11:52:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:27,847 INFO L225 Difference]: With dead ends: 124 [2022-11-16 11:52:27,847 INFO L226 Difference]: Without dead ends: 124 [2022-11-16 11:52:27,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=943, Invalid=9361, Unknown=6, NotChecked=402, Total=10712 [2022-11-16 11:52:27,848 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 447 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:27,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1592 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2177 Invalid, 0 Unknown, 53 Unchecked, 2.9s Time] [2022-11-16 11:52:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-16 11:52:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-16 11:52:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 116 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:52:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2022-11-16 11:52:27,854 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 65 [2022-11-16 11:52:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:27,855 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2022-11-16 11:52:27,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:52:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-11-16 11:52:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:52:27,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:27,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:27,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:28,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:52:28,065 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:52:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2022-11-16 11:52:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:28,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410151923] [2022-11-16 11:52:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:52:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:52:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:52:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 11:52:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410151923] [2022-11-16 11:52:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410151923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:28,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144942319] [2022-11-16 11:52:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:28,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:52:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:28,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:52:28,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:52:28,245 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:52:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:28,423 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-11-16 11:52:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:52:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-11-16 11:52:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:28,425 INFO L225 Difference]: With dead ends: 125 [2022-11-16 11:52:28,425 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 11:52:28,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:28,426 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:28,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:52:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 11:52:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-11-16 11:52:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.25) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:52:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-11-16 11:52:28,432 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 68 [2022-11-16 11:52:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:28,432 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-11-16 11:52:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:52:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-11-16 11:52:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:52:28,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:28,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 11:52:28,435 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:52:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2022-11-16 11:52:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982889714] [2022-11-16 11:52:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:52:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:52:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:52:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982889714] [2022-11-16 11:52:32,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982889714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611191867] [2022-11-16 11:52:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:32,485 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:32,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:52:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:33,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-16 11:52:33,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:33,226 INFO L350 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 [2022-11-16 11:52:33,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:34,148 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:34,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:52:34,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:52:34,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:52:34,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:34,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:52:34,927 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:34,928 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-16 11:52:34,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 11:52:35,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:35,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2022-11-16 11:52:35,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:52:35,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:52:36,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:36,511 INFO L350 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 16 treesize of output 11 [2022-11-16 11:52:36,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:36,540 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:52:36,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2022-11-16 11:52:36,567 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-16 11:52:36,567 INFO L350 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 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-16 11:52:36,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:36,622 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:52:36,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:52:38,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:38,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:52:38,697 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-16 11:52:38,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 173 treesize of output 76 [2022-11-16 11:52:38,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:38,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:52:38,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:52:38,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:38,981 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:52:38,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-16 11:52:38,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:52:39,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:39,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:52:39,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:39,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2022-11-16 11:52:39,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:52:39,504 INFO L350 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 15 treesize of output 7 [2022-11-16 11:52:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:52:39,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:39,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5581 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 11:52:39,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (v_ArrVal_5581 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 11:52:41,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5596 (Array Int Int)) (v_ArrVal_5598 (Array Int Int)) (v_ArrVal_5597 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| Int) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_5581 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5598)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5596))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5597) .cse0 v_ArrVal_5577) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5582) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 v_ArrVal_5578)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 v_ArrVal_5579) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| |c_#StackHeapBarrier|)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-11-16 11:52:41,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611191867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:41,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:41,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 65 [2022-11-16 11:52:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314428967] [2022-11-16 11:52:41,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:41,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 11:52:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 11:52:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=4855, Unknown=4, NotChecked=426, Total=5550 [2022-11-16 11:52:41,637 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:52:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:54,403 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-16 11:52:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:52:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-16 11:52:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:54,406 INFO L225 Difference]: With dead ends: 183 [2022-11-16 11:52:54,406 INFO L226 Difference]: Without dead ends: 183 [2022-11-16 11:52:54,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2429 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=965, Invalid=9755, Unknown=4, NotChecked=618, Total=11342 [2022-11-16 11:52:54,409 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1222 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:54,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1197 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-16 11:52:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-16 11:52:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2022-11-16 11:52:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:52:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-11-16 11:52:54,415 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 68 [2022-11-16 11:52:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:54,416 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-11-16 11:52:54,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:52:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-11-16 11:52:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 11:52:54,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:54,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:54,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:54,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:52:54,627 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:52:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2022-11-16 11:52:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:54,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579034519] [2022-11-16 11:52:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:52:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:52:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:52:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:59,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579034519] [2022-11-16 11:52:59,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579034519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:59,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817728551] [2022-11-16 11:52:59,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:59,362 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:59,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:52:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:59,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-16 11:52:59,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:53:00,072 INFO L350 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 [2022-11-16 11:53:00,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:53:01,060 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:53:01,061 INFO L350 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 [2022-11-16 11:53:01,414 INFO L350 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 13 treesize of output 9 [2022-11-16 11:53:01,437 INFO L350 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 13 treesize of output 9 [2022-11-16 11:53:01,664 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:01,664 INFO L350 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 55 treesize of output 52 [2022-11-16 11:53:01,677 INFO L350 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 22 treesize of output 24 [2022-11-16 11:53:02,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:53:02,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2022-11-16 11:53:02,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:53:02,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:53:02,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:53:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:03,406 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:53:03,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:53:03,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:03,430 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:53:03,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-16 11:53:03,458 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:53:03,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:53:05,280 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:53:05,280 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 109 [2022-11-16 11:53:05,326 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:53:05,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 70 [2022-11-16 11:53:05,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:05,581 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:53:05,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 84 [2022-11-16 11:53:05,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:05,602 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:53:05,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2022-11-16 11:53:06,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:53:06,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:53:06,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:06,798 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-16 11:53:06,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 55 [2022-11-16 11:53:06,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:06,831 INFO L321 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2022-11-16 11:53:06,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 31 [2022-11-16 11:53:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:53:07,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:53:08,551 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) 4)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))) is different from false [2022-11-16 11:53:08,591 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (<= 0 (+ (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) 4)))))) is different from false [2022-11-16 11:53:08,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:53:08,652 INFO L350 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 124 treesize of output 128 [2022-11-16 11:53:08,823 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (forall ((v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_32 Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (<= 0 (+ (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)) 4)) (< (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1)))))) is different from false [2022-11-16 11:53:10,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2) 1)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (= .cse1 (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (<= 0 (+ 4 (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)))) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32)))))))) is different from false [2022-11-16 11:53:10,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) .cse0))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (<= 0 (+ 4 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 1)))))))) is different from false [2022-11-16 11:53:10,777 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5884) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5883))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) .cse0))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_34) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_35))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (<= 0 (+ (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_prenex_33) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)) 4)) (not (<= 0 v_prenex_32))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5884))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 1)))))))) is different from false [2022-11-16 11:53:11,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817728551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:11,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:11,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2022-11-16 11:53:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509634986] [2022-11-16 11:53:11,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:11,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:53:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:53:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5895, Unknown=52, NotChecked=954, Total=7140 [2022-11-16 11:53:11,816 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:53:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:53:21,062 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-11-16 11:53:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:53:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-16 11:53:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:53:21,065 INFO L225 Difference]: With dead ends: 157 [2022-11-16 11:53:21,065 INFO L226 Difference]: Without dead ends: 157 [2022-11-16 11:53:21,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=500, Invalid=10184, Unknown=52, NotChecked=1254, Total=11990 [2022-11-16 11:53:21,068 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 276 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:53:21,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1692 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2267 Invalid, 0 Unknown, 249 Unchecked, 2.8s Time] [2022-11-16 11:53:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-16 11:53:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-11-16 11:53:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 124 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:53:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2022-11-16 11:53:21,074 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 70 [2022-11-16 11:53:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:53:21,075 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2022-11-16 11:53:21,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:53:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-11-16 11:53:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 11:53:21,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:53:21,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:53:21,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-16 11:53:21,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:53:21,286 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:53:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2022-11-16 11:53:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:21,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051608603] [2022-11-16 11:53:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:53:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:24,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:53:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:53:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:53:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:25,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051608603] [2022-11-16 11:53:25,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051608603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:25,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288495679] [2022-11-16 11:53:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:53:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:53:25,690 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:53:25,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:53:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:26,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-16 11:53:26,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:53:26,415 INFO L350 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 6 treesize of output 5 [2022-11-16 11:53:27,303 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:53:27,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:53:27,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-16 11:53:27,802 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:27,802 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-16 11:53:28,446 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:53:28,446 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 29 [2022-11-16 11:53:28,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:53:29,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:29,451 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:53:29,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 80 [2022-11-16 11:53:29,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:29,468 INFO L350 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 66 treesize of output 64 [2022-11-16 11:53:29,530 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-16 11:53:29,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-11-16 11:53:30,804 INFO L321 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2022-11-16 11:53:30,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 95 [2022-11-16 11:53:30,839 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:53:30,839 INFO L350 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 108 treesize of output 91 [2022-11-16 11:53:30,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:30,904 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:53:30,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 98 [2022-11-16 11:53:30,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:30,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-11-16 11:53:31,114 INFO L350 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 67 treesize of output 51 [2022-11-16 11:53:31,726 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-16 11:53:31,726 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 34 [2022-11-16 11:53:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:53:32,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:53:32,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6179 (Array Int Int)) (v_ArrVal_6180 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6179))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6180) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-16 11:53:32,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6175 Int) (v_ArrVal_6179 (Array Int Int)) (v_ArrVal_6180 (Array Int Int)) (v_ArrVal_6177 Int)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_6175)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6179))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_6177)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6180) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-11-16 11:53:33,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288495679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:33,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:33,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 65 [2022-11-16 11:53:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535082787] [2022-11-16 11:53:33,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:33,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 11:53:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:33,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 11:53:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4872, Unknown=9, NotChecked=282, Total=5402 [2022-11-16 11:53:33,910 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:53:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:53:41,172 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-11-16 11:53:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:53:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-16 11:53:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:53:41,174 INFO L225 Difference]: With dead ends: 156 [2022-11-16 11:53:41,174 INFO L226 Difference]: Without dead ends: 156 [2022-11-16 11:53:41,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=538, Invalid=8771, Unknown=11, NotChecked=382, Total=9702 [2022-11-16 11:53:41,176 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 169 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:53:41,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1834 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1938 Invalid, 0 Unknown, 267 Unchecked, 2.3s Time] [2022-11-16 11:53:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-16 11:53:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2022-11-16 11:53:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 129 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:53:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2022-11-16 11:53:41,189 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 70 [2022-11-16 11:53:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:53:41,189 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2022-11-16 11:53:41,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:53:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2022-11-16 11:53:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:53:41,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:53:41,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:53:41,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-16 11:53:41,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 11:53:41,395 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:53:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2022-11-16 11:53:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:41,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349861150] [2022-11-16 11:53:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:53:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:53:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:45,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:53:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:53:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:45,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349861150] [2022-11-16 11:53:45,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349861150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:45,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438192346] [2022-11-16 11:53:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:53:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:53:45,915 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:53:45,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:53:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:46,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-16 11:53:46,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:53:46,728 INFO L350 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 [2022-11-16 11:53:47,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:53:47,572 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:53:47,573 INFO L350 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 [2022-11-16 11:53:47,912 INFO L350 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 13 treesize of output 9 [2022-11-16 11:53:47,928 INFO L350 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 13 treesize of output 9 [2022-11-16 11:53:48,152 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:48,152 INFO L350 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 57 treesize of output 54 [2022-11-16 11:53:48,165 INFO L350 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 22 treesize of output 24 [2022-11-16 11:53:48,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:53:48,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-11-16 11:53:48,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:53:48,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:53:48,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:53:49,696 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:53:49,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:53:51,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:53:51,490 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-11-16 11:53:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 82 [2022-11-16 11:53:51,526 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:53:51,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 125 [2022-11-16 11:53:51,788 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:53:51,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 191 [2022-11-16 11:53:51,820 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:53:51,820 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 203 [2022-11-16 11:53:53,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:53:53,075 INFO L321 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2022-11-16 11:53:53,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 134 [2022-11-16 11:53:53,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:53:53,595 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-16 11:53:53,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 45 [2022-11-16 11:53:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:53:53,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:53:54,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0))))) is different from false [2022-11-16 11:53:54,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))) is different from false [2022-11-16 11:53:55,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-11-16 11:53:55,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-11-16 11:53:55,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0))))))) is different from false [2022-11-16 11:53:55,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6480))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6479))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-11-16 11:53:55,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438192346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:55,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:55,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 66 [2022-11-16 11:53:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020288218] [2022-11-16 11:53:55,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:55,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 11:53:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 11:53:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5190, Unknown=8, NotChecked=894, Total=6320 [2022-11-16 11:53:55,733 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:54:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:05,252 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-11-16 11:54:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:54:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2022-11-16 11:54:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:05,253 INFO L225 Difference]: With dead ends: 136 [2022-11-16 11:54:05,253 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 11:54:05,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=698, Invalid=9020, Unknown=8, NotChecked=1194, Total=10920 [2022-11-16 11:54:05,255 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 385 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:05,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1935 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 210 Unchecked, 2.6s Time] [2022-11-16 11:54:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 11:54:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-11-16 11:54:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.238938053097345) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:54:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-16 11:54:05,262 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 74 [2022-11-16 11:54:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:05,262 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-16 11:54:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:54:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-16 11:54:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:54:05,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:05,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:05,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-16 11:54:05,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:05,475 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:54:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -563328045, now seen corresponding path program 1 times [2022-11-16 11:54:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:05,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103207828] [2022-11-16 11:54:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:54:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:09,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:54:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:54:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:54:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:11,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103207828] [2022-11-16 11:54:11,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103207828] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:11,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964750456] [2022-11-16 11:54:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:11,041 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:11,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:54:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 176 conjunts are in the unsatisfiable core [2022-11-16 11:54:11,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:11,798 INFO L350 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 [2022-11-16 11:54:12,190 INFO L350 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 [2022-11-16 11:54:12,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:12,333 INFO L350 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 21 treesize of output 20 [2022-11-16 11:54:12,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:54:12,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:54:13,376 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:54:13,376 INFO L350 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 [2022-11-16 11:54:13,403 INFO L350 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 14 treesize of output 16 [2022-11-16 11:54:13,783 INFO L350 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 14 treesize of output 16 [2022-11-16 11:54:13,817 INFO L350 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 14 treesize of output 16 [2022-11-16 11:54:13,827 INFO L350 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 13 treesize of output 9 [2022-11-16 11:54:13,840 INFO L350 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 13 treesize of output 9 [2022-11-16 11:54:14,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:54:14,111 INFO L350 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 101 treesize of output 92 [2022-11-16 11:54:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:14,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-16 11:54:14,137 INFO L350 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 22 treesize of output 24 [2022-11-16 11:54:15,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:15,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-16 11:54:15,018 INFO L350 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 7 treesize of output 3 [2022-11-16 11:54:15,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:15,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:54:15,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:54:15,952 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:54:15,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:54:17,997 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:54:17,998 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 135 [2022-11-16 11:54:18,050 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:54:18,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 91 [2022-11-16 11:54:18,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:54:18,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:18,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2022-11-16 11:54:18,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:18,314 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:18,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 66 [2022-11-16 11:54:18,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:54:18,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:18,352 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:54:18,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:54:19,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:54:19,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:19,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:19,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 42 [2022-11-16 11:54:19,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:19,472 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:54:19,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 16 [2022-11-16 11:54:19,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:54:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:19,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:23,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6791 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6789) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6793))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6787) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6791))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6792) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)))))) is different from false [2022-11-16 11:54:24,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6791 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6789) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6793))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6787) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6791))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6792) (select (select .cse2 .cse3) .cse4)) (select (select .cse0 .cse3) .cse4))))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))))))) is different from false [2022-11-16 11:54:24,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6791 (Array Int Int)) (v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6807 (Array Int Int)) (v_ArrVal_6806 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6808)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6807))) (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse6 .cse8) .cse9))) (let ((.cse5 (store (store .cse7 .cse1 v_ArrVal_6789) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6793))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store .cse6 .cse1 v_ArrVal_6787) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6791))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6806))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6792) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| (select (select .cse7 .cse8) .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (< (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))) is different from false [2022-11-16 11:54:24,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964750456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:24,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:54:24,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 69 [2022-11-16 11:54:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176959233] [2022-11-16 11:54:24,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-16 11:54:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:24,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-16 11:54:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5652, Unknown=82, NotChecked=462, Total=6480 [2022-11-16 11:54:24,413 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:54:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:30,039 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-11-16 11:54:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:54:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2022-11-16 11:54:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:30,042 INFO L225 Difference]: With dead ends: 137 [2022-11-16 11:54:30,042 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 11:54:30,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=530, Invalid=8903, Unknown=85, NotChecked=582, Total=10100 [2022-11-16 11:54:30,044 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 151 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:30,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1901 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1877 Invalid, 0 Unknown, 229 Unchecked, 2.2s Time] [2022-11-16 11:54:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 11:54:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-11-16 11:54:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 11:54:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-11-16 11:54:30,060 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 74 [2022-11-16 11:54:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-11-16 11:54:30,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:54:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-11-16 11:54:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:54:30,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:30,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:30,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-16 11:54:30,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:30,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:54:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 364845693, now seen corresponding path program 3 times [2022-11-16 11:54:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726795479] [2022-11-16 11:54:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:54:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:54:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:54:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 11:54:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-16 11:54:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:30,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726795479] [2022-11-16 11:54:30,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726795479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:30,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968494894] [2022-11-16 11:54:30,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:54:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:30,489 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:30,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:54:31,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:54:31,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:31,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-16 11:54:31,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:31,946 INFO L350 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 [2022-11-16 11:54:32,029 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 11:54:32,030 INFO L350 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 37 treesize of output 27 [2022-11-16 11:54:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:32,470 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:32,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-11-16 11:54:32,515 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-16 11:54:32,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 11:54:32,736 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:32,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-11-16 11:54:32,846 INFO L350 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 13 treesize of output 9 [2022-11-16 11:54:32,880 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-16 11:54:32,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-11-16 11:54:33,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:33,123 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2022-11-16 11:54:33,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 88 [2022-11-16 11:54:33,138 INFO L350 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 77 treesize of output 77 [2022-11-16 11:54:33,795 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2022-11-16 11:54:33,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 60 [2022-11-16 11:54:33,809 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:54:33,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:54:33,830 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:54:33,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:54:34,163 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_7171 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7171) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_7172 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7172))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 11:54:34,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:34,264 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-16 11:54:34,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 164 treesize of output 126 [2022-11-16 11:54:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:34,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:34,281 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:54:34,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2022-11-16 11:54:34,373 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2022-11-16 11:54:34,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 117 [2022-11-16 11:54:35,359 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:54:35,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 164 [2022-11-16 11:54:35,911 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-11-16 11:54:35,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 71 [2022-11-16 11:54:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-16 11:54:36,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:37,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_100| Int) (v_ArrVal_7183 (Array Int Int)) (v_ArrVal_7182 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_100| v_ArrVal_7183)) (.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_100| v_ArrVal_7182))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (store |c_#valid| |v_node_create_~temp~0#1.base_100| 1)) (.cse1 (select (select .cse3 .cse2) .cse5))) (or (not (< |v_node_create_~temp~0#1.base_100| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) 1)) (not (= (select .cse0 .cse2) 1)) (= (select .cse0 (select (select .cse3 .cse1) (+ (select (select .cse4 .cse2) .cse5) 4))) 1) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_100|) 0))))))) is different from false [2022-11-16 11:54:37,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968494894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:37,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:54:37,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-11-16 11:54:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67195660] [2022-11-16 11:54:37,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:37,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 11:54:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 11:54:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1843, Unknown=5, NotChecked=174, Total=2162 [2022-11-16 11:54:37,057 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 11:54:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:38,290 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-16 11:54:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:54:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-11-16 11:54:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:38,292 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:54:38,292 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:54:38,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=231, Invalid=3191, Unknown=8, NotChecked=230, Total=3660 [2022-11-16 11:54:38,293 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:38,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 987 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 539 Unchecked, 0.3s Time] [2022-11-16 11:54:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:54:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 11:54:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:54:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-16 11:54:38,298 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 75 [2022-11-16 11:54:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:38,298 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-16 11:54:38,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 11:54:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-16 11:54:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 11:54:38,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:38,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:38,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:38,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 11:54:38,500 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:54:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -192357779, now seen corresponding path program 2 times [2022-11-16 11:54:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671791844] [2022-11-16 11:54:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:54:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:54:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:54:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:54:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671791844] [2022-11-16 11:54:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671791844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249014805] [2022-11-16 11:54:44,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:54:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:44,635 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:44,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:54:45,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:54:45,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:45,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-16 11:54:45,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:45,374 INFO L350 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 [2022-11-16 11:54:45,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:54:45,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:45,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:54:46,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:54:46,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:54:46,863 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:54:46,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 11:54:46,887 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:54:46,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:54:47,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:54:47,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:54:47,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:54:47,694 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-16 11:54:47,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:54:48,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:48,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 41 [2022-11-16 11:54:48,648 INFO L350 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 7 [2022-11-16 11:54:48,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:54:48,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:48,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:54:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:49,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 11:54:49,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:49,863 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:49,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 76 [2022-11-16 11:54:49,911 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:54:49,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:54:49,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:49,934 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:54:49,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:54:52,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:54:52,630 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2022-11-16 11:54:52,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 248 treesize of output 132 [2022-11-16 11:54:52,699 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-16 11:54:52,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 94 [2022-11-16 11:54:53,108 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:54:53,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 203 [2022-11-16 11:54:53,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:53,172 INFO L321 Elim1Store]: treesize reduction 110, result has 20.3 percent of original size [2022-11-16 11:54:53,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 237 treesize of output 190 [2022-11-16 11:54:58,897 INFO L321 Elim1Store]: treesize reduction 170, result has 62.8 percent of original size [2022-11-16 11:54:58,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 521 treesize of output 513 [2022-11-16 11:54:59,936 INFO L321 Elim1Store]: treesize reduction 128, result has 66.4 percent of original size [2022-11-16 11:54:59,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 511 treesize of output 609 [2022-11-16 11:55:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:55:50,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:02,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249014805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:02,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:56:02,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 77 [2022-11-16 11:56:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564970415] [2022-11-16 11:56:02,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:02,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-16 11:56:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-16 11:56:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=9012, Unknown=12, NotChecked=0, Total=9312 [2022-11-16 11:56:02,925 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:56:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:15,900 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-16 11:56:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:56:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2022-11-16 11:56:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:15,902 INFO L225 Difference]: With dead ends: 92 [2022-11-16 11:56:15,902 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 11:56:15,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=604, Invalid=15383, Unknown=15, NotChecked=0, Total=16002 [2022-11-16 11:56:15,904 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:15,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1825 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1872 Invalid, 0 Unknown, 336 Unchecked, 2.4s Time] [2022-11-16 11:56:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 11:56:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 11:56:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:56:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-11-16 11:56:15,912 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 76 [2022-11-16 11:56:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:15,913 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-11-16 11:56:15,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:56:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-11-16 11:56:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 11:56:15,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:15,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:15,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:56:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 11:56:16,115 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:56:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -192357780, now seen corresponding path program 2 times [2022-11-16 11:56:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:16,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223631805] [2022-11-16 11:56:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:56:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:23,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:56:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:56:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:56:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:56:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:56:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223631805] [2022-11-16 11:56:26,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223631805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787900047] [2022-11-16 11:56:26,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:56:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:56:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:56:26,412 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:56:26,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:56:27,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:56:27,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:56:27,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-16 11:56:27,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:56:28,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:56:28,693 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:56:28,693 INFO L350 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 [2022-11-16 11:56:29,195 INFO L350 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 13 treesize of output 9 [2022-11-16 11:56:29,203 INFO L350 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 13 treesize of output 9 [2022-11-16 11:56:29,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:56:29,435 INFO L350 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 57 treesize of output 54 [2022-11-16 11:56:29,456 INFO L350 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 22 treesize of output 24 [2022-11-16 11:56:30,376 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:56:30,376 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-16 11:56:30,397 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:56:30,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:56:30,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:56:31,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:31,659 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:56:31,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 83 [2022-11-16 11:56:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:31,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:31,675 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:56:31,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2022-11-16 11:56:31,744 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-16 11:56:31,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-11-16 11:56:33,923 INFO L321 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2022-11-16 11:56:33,924 INFO L350 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 95 [2022-11-16 11:56:33,964 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:56:33,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 141 [2022-11-16 11:56:34,315 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:56:34,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 339 treesize of output 232 [2022-11-16 11:56:34,353 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:56:34,353 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 240 [2022-11-16 11:56:35,825 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:56:35,825 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 169 [2022-11-16 11:56:36,636 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-16 11:56:36,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 56 [2022-11-16 11:56:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:56:37,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:37,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1)) is different from false [2022-11-16 11:56:37,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1)) is different from false [2022-11-16 11:56:37,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1)) is different from false [2022-11-16 11:56:37,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2)))))))) 1)) is different from false [2022-11-16 11:56:41,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 1)) is different from false [2022-11-16 11:56:41,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 1)) is different from false [2022-11-16 11:56:42,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787900047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:56:42,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:56:42,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37] total 82 [2022-11-16 11:56:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721698426] [2022-11-16 11:56:42,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:42,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-16 11:56:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-16 11:56:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=7506, Unknown=87, NotChecked=1074, Total=8930 [2022-11-16 11:56:42,237 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:56:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:57,325 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-11-16 11:56:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:56:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2022-11-16 11:56:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:57,327 INFO L225 Difference]: With dead ends: 106 [2022-11-16 11:56:57,328 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 11:56:57,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3030 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=598, Invalid=14077, Unknown=111, NotChecked=1470, Total=16256 [2022-11-16 11:56:57,330 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 145 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:57,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1586 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2329 Invalid, 0 Unknown, 203 Unchecked, 3.9s Time] [2022-11-16 11:56:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 11:56:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-11-16 11:56:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 87 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:56:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-16 11:56:57,335 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 76 [2022-11-16 11:56:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:57,336 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-16 11:56:57,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:56:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-16 11:56:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-16 11:56:57,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:57,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:57,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:56:57,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-16 11:56:57,547 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:56:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -172230625, now seen corresponding path program 1 times [2022-11-16 11:56:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:57,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140374379] [2022-11-16 11:56:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:57:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:57:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:57:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:57:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140374379] [2022-11-16 11:57:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140374379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940912483] [2022-11-16 11:57:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:02,379 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:02,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:57:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:03,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-16 11:57:03,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:03,277 INFO L350 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 [2022-11-16 11:57:03,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:57:04,242 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:57:04,242 INFO L350 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 [2022-11-16 11:57:04,583 INFO L350 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 13 treesize of output 9 [2022-11-16 11:57:04,591 INFO L350 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 13 treesize of output 9 [2022-11-16 11:57:04,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:57:04,801 INFO L350 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 57 treesize of output 54 [2022-11-16 11:57:04,818 INFO L350 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 22 treesize of output 24 [2022-11-16 11:57:05,602 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:57:05,602 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-16 11:57:05,625 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:57:05,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:57:05,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:57:06,492 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:57:06,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:57:06,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 .cse1)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse5 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse3 .cse5)) (.cse6 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 .cse1)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse1) .cse5)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-16 11:57:06,626 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 .cse1)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse5 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse3 .cse5)) (.cse6 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 .cse1)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse1) .cse5)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-16 11:57:08,123 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:57:08,123 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 133 [2022-11-16 11:57:08,168 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-16 11:57:08,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 99 [2022-11-16 11:57:08,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:08,432 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:57:08,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 110 [2022-11-16 11:57:08,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:08,461 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-16 11:57:08,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 115 [2022-11-16 11:57:09,368 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:57:09,368 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 61 [2022-11-16 11:57:10,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:10,184 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:57:10,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 29 [2022-11-16 11:57:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:10,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:10,348 INFO L350 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 8 treesize of output 6 [2022-11-16 11:57:11,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))) is different from false [2022-11-16 11:57:12,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))) is different from false [2022-11-16 11:57:12,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ 4 .cse0)))))))))) is different from false [2022-11-16 11:57:12,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse0 .cse2) .cse3))) (or (<= 0 (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (+ .cse4 4))) (not (<= 0 .cse4))))))))) is different from false [2022-11-16 11:57:12,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))))) is different from false [2022-11-16 11:57:12,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))))) is different from false [2022-11-16 11:57:12,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940912483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:12,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:57:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 64 [2022-11-16 11:57:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528873298] [2022-11-16 11:57:12,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:12,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 11:57:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:12,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 11:57:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5294, Unknown=49, NotChecked=1064, Total=6642 [2022-11-16 11:57:12,900 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:57:17,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse13)) (.cse25 (+ .cse3 4))) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse19 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse10 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse11 (select .cse16 .cse25))) (let ((.cse0 (not (= .cse11 .cse13))) (.cse1 (= (select .cse18 .cse25) 0)) (.cse5 (select .cse24 .cse10)) (.cse7 (select .cse16 4)) (.cse17 (select .cse23 4)) (.cse21 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (select .cse24 4)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19)) (.cse4 (select .cse23 .cse22)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= .cse3 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse5 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse7) 1) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse9 .cse10) 0) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (or (and .cse0 (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select .cse16 .cse14)) (.cse15 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse12) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse12 .cse13)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse13) .cse14)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse15 (select |c_#memory_$Pointer$.offset| .cse15)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= .cse15 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))))) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse18 4) 0) (not (= .cse7 .cse13)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse11) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= (select .cse20 4) 0) (= (select |c_#valid| .cse5) 1) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse21 .cse2)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse13) 1) (not (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#valid| .cse17) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse21 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse21)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse6) 1) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select .cse20 .cse22) 0) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse4) 1) (= (select .cse9 4) 0)))))) is different from false [2022-11-16 11:57:17,506 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse13)) (.cse25 (+ .cse3 4))) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse19 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse10 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse11 (select .cse16 .cse25))) (let ((.cse0 (not (= .cse11 .cse13))) (.cse1 (= (select .cse18 .cse25) 0)) (.cse5 (select .cse24 .cse10)) (.cse7 (select .cse16 4)) (.cse17 (select .cse23 4)) (.cse21 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (select .cse24 4)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19)) (.cse4 (select .cse23 .cse22)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= .cse3 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse5 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse7) 1) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse9 .cse10) 0) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (or (and .cse0 (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select .cse16 .cse14)) (.cse15 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse12) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse12 .cse13)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse13) .cse14)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse15 (select |c_#memory_$Pointer$.offset| .cse15)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= .cse15 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))))) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse18 4) 0) (not (= .cse7 .cse13)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse11) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= (select .cse20 4) 0) (= (select |c_#valid| .cse5) 1) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse21 .cse2)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse13) 1) (not (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#valid| .cse17) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse21 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse21)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse6) 1) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select .cse20 .cse22) 0) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse4) 1) (= (select .cse9 4) 0)))))) is different from true [2022-11-16 11:57:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:20,985 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-11-16 11:57:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:57:20,985 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 78 [2022-11-16 11:57:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:20,987 INFO L225 Difference]: With dead ends: 115 [2022-11-16 11:57:20,987 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 11:57:20,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=498, Invalid=8988, Unknown=52, NotChecked=1592, Total=11130 [2022-11-16 11:57:20,989 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 167 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:20,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1758 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1840 Invalid, 0 Unknown, 199 Unchecked, 2.7s Time] [2022-11-16 11:57:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 11:57:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-11-16 11:57:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:57:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-16 11:57:20,995 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 78 [2022-11-16 11:57:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:20,995 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-16 11:57:20,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:57:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-16 11:57:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 11:57:20,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:20,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:21,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:21,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 11:57:21,206 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:57:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1990095940, now seen corresponding path program 2 times [2022-11-16 11:57:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:21,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628334000] [2022-11-16 11:57:21,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:57:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:57:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:57:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:57:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:30,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628334000] [2022-11-16 11:57:30,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628334000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:30,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876344085] [2022-11-16 11:57:30,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:57:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:30,542 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:30,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-16 11:57:31,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:57:31,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:57:31,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-16 11:57:31,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:31,403 INFO L350 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 [2022-11-16 11:57:31,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:57:31,928 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:57:31,928 INFO L350 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 [2022-11-16 11:57:32,913 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:57:32,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2022-11-16 11:57:33,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 11:57:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-16 11:57:33,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:57:33,792 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-16 11:57:33,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:57:34,810 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:57:34,810 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 39 [2022-11-16 11:57:34,835 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:57:34,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:57:34,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:57:35,536 INFO L350 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 [2022-11-16 11:57:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:35,991 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:57:35,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 83 [2022-11-16 11:57:36,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:36,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:36,012 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:57:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 77 [2022-11-16 11:57:36,060 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:57:36,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:57:39,091 INFO L321 Elim1Store]: treesize reduction 114, result has 15.6 percent of original size [2022-11-16 11:57:39,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 234 treesize of output 104 [2022-11-16 11:57:39,147 INFO L321 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-11-16 11:57:39,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 133 [2022-11-16 11:57:39,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:57:39,609 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:57:39,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 179 [2022-11-16 11:57:39,664 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-16 11:57:39,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 256 [2022-11-16 11:57:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:39,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-11-16 11:57:42,602 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-16 11:57:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 99 [2022-11-16 11:57:42,649 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 11:57:42,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-11-16 11:57:43,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:57:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:57:43,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:44,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8374 Int) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8372 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8372)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8371))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse4 .cse5) .cse6))) (or (<= (+ .cse0 1) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ .cse0 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_8374)) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2022-11-16 11:57:44,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8374 Int) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8372 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8372)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8371))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse5 .cse6) .cse7))) (or (<= (+ .cse0 1) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_8368))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_8374))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))))) is different from false [2022-11-16 11:57:48,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:57:48,454 INFO L350 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 1383 treesize of output 1376 [2022-11-16 11:57:48,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:57:48,534 INFO L350 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 23232 treesize of output 21928 [2022-11-16 11:57:48,573 INFO L350 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 26504 treesize of output 21940 [2022-11-16 11:57:48,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:57:48,676 INFO L350 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 8605 treesize of output 7957 [2022-11-16 11:57:48,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:57:48,928 INFO L350 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 21287 treesize of output 19335 [2022-11-16 11:58:38,771 WARN L233 SmtUtils]: Spent 30.25s on a formula simplification. DAG size of input: 101 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:38,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876344085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:38,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:58:38,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 42] total 81 [2022-11-16 11:58:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498432290] [2022-11-16 11:58:38,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-16 11:58:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-16 11:58:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=8309, Unknown=3, NotChecked=366, Total=8930 [2022-11-16 11:58:38,780 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:58:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:56,854 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-11-16 11:58:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 11:58:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 80 [2022-11-16 11:58:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:56,856 INFO L225 Difference]: With dead ends: 119 [2022-11-16 11:58:56,856 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:58:56,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2114 ImplicationChecksByTransitivity, 79.6s TimeCoverageRelationStatistics Valid=554, Invalid=14213, Unknown=3, NotChecked=482, Total=15252 [2022-11-16 11:58:56,858 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:56,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 2105 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2853 Invalid, 0 Unknown, 122 Unchecked, 4.6s Time] [2022-11-16 11:58:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:58:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2022-11-16 11:58:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.2) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:58:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-16 11:58:56,861 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 80 [2022-11-16 11:58:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:56,862 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-16 11:58:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:58:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-16 11:58:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 11:58:56,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:56,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:56,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:57,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:57,064 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-16 11:58:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1990140642, now seen corresponding path program 2 times [2022-11-16 11:58:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274547164] [2022-11-16 11:58:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:59:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:59:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:59:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:59:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:06,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274547164] [2022-11-16 11:59:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274547164] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:59:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854288286] [2022-11-16 11:59:06,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:59:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:59:06,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:59:06,501 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:59:06,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eed9158-d476-4319-b0de-7ac4cec7b174/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-16 11:59:07,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:59:07,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:59:07,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 183 conjunts are in the unsatisfiable core [2022-11-16 11:59:07,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:08,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:59:08,811 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:59:08,812 INFO L350 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 [2022-11-16 11:59:09,309 INFO L350 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 13 treesize of output 9 [2022-11-16 11:59:09,317 INFO L350 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 13 treesize of output 9 [2022-11-16 11:59:09,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:09,560 INFO L350 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 57 treesize of output 54 [2022-11-16 11:59:09,570 INFO L350 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 22 treesize of output 24 [2022-11-16 11:59:10,460 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:59:10,461 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-16 11:59:10,484 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:59:10,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:59:10,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:59:11,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:11,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:11,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:12,035 INFO L321 Elim1Store]: treesize reduction 172, result has 7.0 percent of original size [2022-11-16 11:59:12,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 77 [2022-11-16 11:59:12,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:12,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:12,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:12,075 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:59:12,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2022-11-16 11:59:12,134 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:59:12,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:59:15,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:15,915 INFO L321 Elim1Store]: treesize reduction 166, result has 14.4 percent of original size [2022-11-16 11:59:15,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 254 treesize of output 127 [2022-11-16 11:59:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:15,991 INFO L321 Elim1Store]: treesize reduction 152, result has 14.6 percent of original size [2022-11-16 11:59:15,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 205 treesize of output 144 [2022-11-16 11:59:16,490 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-11-16 11:59:16,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 330 treesize of output 137 [2022-11-16 11:59:16,578 INFO L321 Elim1Store]: treesize reduction 172, result has 16.1 percent of original size [2022-11-16 11:59:16,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 287 treesize of output 228 [2022-11-16 11:59:38,062 WARN L233 SmtUtils]: Spent 11.48s on a formula simplification. DAG size of input: 652 DAG size of output: 604 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 11:59:38,064 INFO L321 Elim1Store]: treesize reduction 288, result has 85.8 percent of original size [2022-11-16 11:59:38,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 33 new quantified variables, introduced 171 case distinctions, treesize of input 1141 treesize of output 2177 [2022-11-16 11:59:38,553 INFO L217 Elim1Store]: Index analysis took 221 ms [2022-11-16 12:00:35,369 WARN L233 SmtUtils]: Spent 56.80s on a formula simplification. DAG size of input: 912 DAG size of output: 804 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 12:00:35,372 INFO L321 Elim1Store]: treesize reduction 652, result has 74.9 percent of original size [2022-11-16 12:00:35,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 1 disjoint index pairs (out of 253 index pairs), introduced 31 new quantified variables, introduced 253 case distinctions, treesize of input 2357 treesize of output 3375