./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/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_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/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_075c7933-efb7-40f1-86fc-e1cc481846ea/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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- 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:45:18,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:45:18,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:45:18,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:45:18,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:45:18,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:45:18,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:45:18,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:45:18,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:45:18,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:45:18,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:45:18,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:45:18,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:45:18,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:45:18,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:45:18,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:45:18,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:45:18,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:45:18,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:45:18,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:45:18,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:45:18,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:45:18,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:45:18,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:45:18,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:45:18,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:45:18,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:45:18,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:45:18,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:45:18,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:45:18,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:45:18,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:45:18,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:45:18,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:45:18,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:45:18,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:45:18,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:45:18,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:45:18,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:45:18,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:45:18,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:45:18,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:45:18,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:45:18,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:45:18,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:45:18,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:45:18,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:45:18,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:45:18,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:45:18,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:45:18,928 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:45:18,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:45:18,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:45:18,929 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:45:18,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:45:18,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:45:18,930 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:45:18,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:45:18,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:45:18,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:45:18,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:45:18,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:45:18,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:45:18,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:45:18,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:45:18,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:45:18,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:45:18,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_075c7933-efb7-40f1-86fc-e1cc481846ea/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_075c7933-efb7-40f1-86fc-e1cc481846ea/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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-11-16 11:45:19,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:45:19,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:45:19,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:45:19,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:45:19,240 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:45:19,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-11-16 11:45:19,318 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/data/9158bef95/0c44a1b754214a66b4a94cc3e18242e4/FLAG945fdb37e [2022-11-16 11:45:19,933 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:45:19,934 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-11-16 11:45:19,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/data/9158bef95/0c44a1b754214a66b4a94cc3e18242e4/FLAG945fdb37e [2022-11-16 11:45:20,222 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/data/9158bef95/0c44a1b754214a66b4a94cc3e18242e4 [2022-11-16 11:45:20,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:45:20,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:45:20,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:45:20,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:45:20,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:45:20,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eadc728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20, skipping insertion in model container [2022-11-16 11:45:20,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:45:20,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:45:20,726 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_075c7933-efb7-40f1-86fc-e1cc481846ea/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-11-16 11:45:20,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:45:20,748 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:45:20,804 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_075c7933-efb7-40f1-86fc-e1cc481846ea/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-11-16 11:45:20,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:45:20,843 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:45:20,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20 WrapperNode [2022-11-16 11:45:20,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:45:20,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:45:20,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:45:20,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:45:20,854 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:45:20" (1/1) ... [2022-11-16 11:45:20,887 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:45:20" (1/1) ... [2022-11-16 11:45:20,923 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-11-16 11:45:20,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:45:20,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:45:20,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:45:20,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:45:20,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:20,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:45:20,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:45:20,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:45:20,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:45:20,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (1/1) ... [2022-11-16 11:45:21,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:45:21,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:21,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:45:21,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:45:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:45:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:45:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:45:21,082 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:45:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:45:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:45:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:45:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:45:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:45:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:45:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:45:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:45:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:45:21,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:45:21,292 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:45:21,294 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:45:21,623 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:45:21,629 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:45:21,629 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:45:21,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:45:21 BoogieIcfgContainer [2022-11-16 11:45:21,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:45:21,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:45:21,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:45:21,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:45:21,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:45:20" (1/3) ... [2022-11-16 11:45:21,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ecdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:21, skipping insertion in model container [2022-11-16 11:45:21,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:20" (2/3) ... [2022-11-16 11:45:21,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ecdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:21, skipping insertion in model container [2022-11-16 11:45:21,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:45:21" (3/3) ... [2022-11-16 11:45:21,641 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-11-16 11:45:21,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:45:21,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:45:21,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:45:21,724 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;@71d9a402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:45:21,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-11-16 11:45:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:45:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:45:21,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:21,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:21,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-11-16 11:45:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768350441] [2022-11-16 11:45:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:22,062 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:45:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:22,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768350441] [2022-11-16 11:45:22,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768350441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:22,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:45:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427525519] [2022-11-16 11:45:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:22,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:45:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:45:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:45:22,110 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:45:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:22,278 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-16 11:45:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:45:22,281 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:45:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:22,291 INFO L225 Difference]: With dead ends: 94 [2022-11-16 11:45:22,292 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:45:22,294 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:45:22,299 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:22,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:45:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-16 11:45:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:45:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-11-16 11:45:22,372 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-11-16 11:45:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:22,373 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-11-16 11:45:22,373 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:45:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-11-16 11:45:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:45:22,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:22,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:22,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:45:22,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-11-16 11:45:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:22,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335949126] [2022-11-16 11:45:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:22,509 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:45:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:22,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335949126] [2022-11-16 11:45:22,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335949126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:22,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:22,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:45:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6520532] [2022-11-16 11:45:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:45:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:45:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:45:22,518 INFO L87 Difference]: Start difference. First operand 91 states and 99 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:45:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:22,614 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-11-16 11:45:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:45:22,615 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:45:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:22,616 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:45:22,616 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:45:22,617 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:45:22,618 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:22,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:45:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-16 11:45:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 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:45:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-11-16 11:45:22,627 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-11-16 11:45:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:22,627 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-11-16 11:45:22,627 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:45:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-11-16 11:45:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:45:22,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:22,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:22,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:45:22,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-11-16 11:45:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:22,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822843516] [2022-11-16 11:45:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:22,938 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:45:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822843516] [2022-11-16 11:45:22,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822843516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:22,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:22,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:45:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941347870] [2022-11-16 11:45:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:22,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:45:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:45:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:45:22,943 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:45:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:23,248 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-11-16 11:45:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:23,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-11-16 11:45:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:23,251 INFO L225 Difference]: With dead ends: 93 [2022-11-16 11:45:23,251 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 11:45:23,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:45:23,253 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:23,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:45:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 11:45:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-11-16 11:45:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 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:45:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-11-16 11:45:23,262 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-11-16 11:45:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:23,263 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-11-16 11:45:23,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:45:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-11-16 11:45:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:45:23,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:23,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:23,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:45:23,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-11-16 11:45:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:23,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94603141] [2022-11-16 11:45:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:23,685 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:45:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94603141] [2022-11-16 11:45:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94603141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:23,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:23,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:45:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960522957] [2022-11-16 11:45:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:45:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:45:23,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:45:23,690 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:45:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:23,933 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-16 11:45:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:23,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-11-16 11:45:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:23,935 INFO L225 Difference]: With dead ends: 92 [2022-11-16 11:45:23,935 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 11:45:23,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:45:23,937 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:23,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:45:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 11:45:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-11-16 11:45:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 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:45:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-11-16 11:45:23,945 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-11-16 11:45:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:23,945 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-11-16 11:45:23,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:45:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-11-16 11:45:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:45:23,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:23,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:23,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:45:23,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-11-16 11:45:23,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:23,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192592937] [2022-11-16 11:45:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:45:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,033 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:45:24,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:24,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192592937] [2022-11-16 11:45:24,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192592937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:24,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:24,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337519515] [2022-11-16 11:45:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:24,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:45:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:45:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:45:24,041 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:45:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:24,147 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-11-16 11:45:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:45:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-16 11:45:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:24,153 INFO L225 Difference]: With dead ends: 93 [2022-11-16 11:45:24,153 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 11:45:24,154 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:45:24,159 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:24,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 11:45:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-11-16 11:45:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 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:45:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-11-16 11:45:24,172 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-11-16 11:45:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:24,172 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-11-16 11:45:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:45:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-11-16 11:45:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:45:24,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:24,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:24,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:45:24,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-11-16 11:45:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:24,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953338854] [2022-11-16 11:45:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:45:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:45:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:24,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953338854] [2022-11-16 11:45:24,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953338854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871963241] [2022-11-16 11:45:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:24,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:24,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:45:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:24,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:45:24,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:45:24,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:45:24,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871963241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:45:24,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:45:24,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-16 11:45:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722191452] [2022-11-16 11:45:24,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:24,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:45:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:45:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:45:24,624 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:45:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:24,721 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-16 11:45:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:45:24,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 28 [2022-11-16 11:45:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:24,725 INFO L225 Difference]: With dead ends: 94 [2022-11-16 11:45:24,725 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 11:45:24,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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:45:24,734 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:24,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 310 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 11:45:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-16 11:45:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 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:45:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-11-16 11:45:24,742 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-11-16 11:45:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:24,742 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-11-16 11:45:24,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:45:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-11-16 11:45:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:45:24,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:24,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:24,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:24,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:45:24,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-11-16 11:45:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:24,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997316104] [2022-11-16 11:45:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-16 11:45:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:25,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997316104] [2022-11-16 11:45:25,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997316104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:25,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:25,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:45:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205798126] [2022-11-16 11:45:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:25,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:45:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:25,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:45:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:45:25,568 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:45:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:25,785 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-11-16 11:45:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:45:25,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 41 [2022-11-16 11:45:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:25,787 INFO L225 Difference]: With dead ends: 101 [2022-11-16 11:45:25,787 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 11:45:25,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:45:25,788 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 139 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:25,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 198 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:45:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 11:45:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-11-16 11:45:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 84 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:45:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-16 11:45:25,793 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2022-11-16 11:45:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:25,793 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-16 11:45:25,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:45:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-16 11:45:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:45:25,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:25,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:25,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:45:25,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-11-16 11:45:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:25,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010886453] [2022-11-16 11:45:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:26,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:45:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:26,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010886453] [2022-11-16 11:45:26,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010886453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:26,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531506163] [2022-11-16 11:45:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:26,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:26,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:45:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:26,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:45:26,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:26,964 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:45:27,003 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:45:27,061 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-16 11:45:27,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:27,189 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:45:27,255 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:45:27,268 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-16 11:45:27,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:27,352 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:45:27,428 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:45:27,447 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_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-16 11:45:27,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:27,529 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:45:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-16 11:45:27,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:27,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531506163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:27,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:27,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-16 11:45:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217368017] [2022-11-16 11:45:27,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:27,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:45:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:45:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-11-16 11:45:27,838 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:45:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:28,298 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-11-16 11:45:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:45:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-16 11:45:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:28,300 INFO L225 Difference]: With dead ends: 96 [2022-11-16 11:45:28,300 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 11:45:28,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-11-16 11:45:28,301 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 241 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:28,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 224 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 237 Unchecked, 0.4s Time] [2022-11-16 11:45:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 11:45:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-16 11:45:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:45:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2022-11-16 11:45:28,306 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 41 [2022-11-16 11:45:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:28,307 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2022-11-16 11:45:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:45:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-11-16 11:45:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:45:28,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:28,308 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:28,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:28,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 11:45:28,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2022-11-16 11:45:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:28,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499134087] [2022-11-16 11:45:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:45:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:29,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499134087] [2022-11-16 11:45:29,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499134087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:29,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83736268] [2022-11-16 11:45:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:29,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:29,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:45:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:30,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-16 11:45:30,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:30,521 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:45:30,526 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:45:30,707 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_616) |c_#memory_$Pointer$.offset|) (= 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_615)))) is different from true [2022-11-16 11:45:30,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:30,773 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:45:30,789 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:45:30,790 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:45:30,804 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 18 treesize of output 13 [2022-11-16 11:45:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:30,813 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 14 treesize of output 16 [2022-11-16 11:45:30,890 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:45:30,895 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:45:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:45:30,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:31,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83736268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:31,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:31,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-16 11:45:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080358780] [2022-11-16 11:45:31,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:31,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 11:45:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 11:45:31,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-11-16 11:45:31,356 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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:45:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:33,434 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-11-16 11:45:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:45:33,434 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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 45 [2022-11-16 11:45:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:33,435 INFO L225 Difference]: With dead ends: 134 [2022-11-16 11:45:33,435 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 11:45:33,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-11-16 11:45:33,437 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 427 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:33,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1191 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1250 Invalid, 0 Unknown, 140 Unchecked, 1.1s Time] [2022-11-16 11:45:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 11:45:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2022-11-16 11:45:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 83 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:45:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-11-16 11:45:33,443 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 45 [2022-11-16 11:45:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:33,443 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-11-16 11:45:33,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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:45:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-11-16 11:45:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:45:33,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:33,445 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:33,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:33,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760006, now seen corresponding path program 1 times [2022-11-16 11:45:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120817883] [2022-11-16 11:45:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:45:34,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120817883] [2022-11-16 11:45:34,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120817883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986743878] [2022-11-16 11:45:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:34,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:34,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:34,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:45:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:34,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:45:34,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:34,799 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:45:34,938 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_784 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784) |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:45:34,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:34,979 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:45:34,995 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:45:34,995 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:45:35,106 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:45:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:45:35,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:35,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986743878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:35,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:45:35,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-16 11:45:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383943714] [2022-11-16 11:45:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:35,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:45:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:45:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-16 11:45:35,125 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 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:45:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:35,523 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-11-16 11:45:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:45:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 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 45 [2022-11-16 11:45:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:35,525 INFO L225 Difference]: With dead ends: 126 [2022-11-16 11:45:35,525 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 11:45:35,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=703, Unknown=2, NotChecked=54, Total=870 [2022-11-16 11:45:35,526 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:35,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 728 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 0 Unknown, 262 Unchecked, 0.3s Time] [2022-11-16 11:45:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 11:45:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2022-11-16 11:45:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 81 states have internal predecessors, (90), 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:45:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-16 11:45:35,530 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 45 [2022-11-16 11:45:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:35,530 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-16 11:45:35,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 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:45:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-16 11:45:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:45:35,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:35,532 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:35,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:35,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:45:35,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash -312140221, now seen corresponding path program 1 times [2022-11-16 11:45:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:35,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569790417] [2022-11-16 11:45:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:45:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:36,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569790417] [2022-11-16 11:45:36,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569790417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:36,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:36,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:45:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777186179] [2022-11-16 11:45:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:36,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:45:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:45:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:45:36,079 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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:45:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:36,378 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-11-16 11:45:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:45:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 47 [2022-11-16 11:45:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:36,379 INFO L225 Difference]: With dead ends: 135 [2022-11-16 11:45:36,379 INFO L226 Difference]: Without dead ends: 135 [2022-11-16 11:45:36,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:45:36,380 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 223 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:36,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 342 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:45:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-16 11:45:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 88. [2022-11-16 11:45:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 83 states have internal predecessors, (94), 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:45:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-11-16 11:45:36,384 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 47 [2022-11-16 11:45:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:36,384 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-11-16 11:45:36,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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:45:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-11-16 11:45:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:45:36,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:36,385 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:36,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:45:36,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -312140220, now seen corresponding path program 1 times [2022-11-16 11:45:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731360833] [2022-11-16 11:45:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 11:45:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:36,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731360833] [2022-11-16 11:45:36,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731360833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:36,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:36,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:45:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379831612] [2022-11-16 11:45:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:36,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:45:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:45:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:45:36,962 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:45:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:37,327 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-11-16 11:45:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:45:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 47 [2022-11-16 11:45:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:37,328 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:45:37,328 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 11:45:37,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:45:37,329 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 193 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:37,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 384 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:45:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 11:45:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-11-16 11:45:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 90 states have internal predecessors, (102), 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:45:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-16 11:45:37,332 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 47 [2022-11-16 11:45:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:37,333 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-16 11:45:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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:45:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-16 11:45:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:45:37,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:37,334 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:37,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:45:37,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 241565309, now seen corresponding path program 1 times [2022-11-16 11:45:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:37,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801839761] [2022-11-16 11:45:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:39,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:45:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801839761] [2022-11-16 11:45:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801839761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86719166] [2022-11-16 11:45:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:40,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:40,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:45:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:40,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-16 11:45:40,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:40,872 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:45:40,873 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 14 treesize of output 20 [2022-11-16 11:45:40,917 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:45:40,917 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:45:41,112 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:45:41,123 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:45:41,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:45:41,672 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 75 treesize of output 38 [2022-11-16 11:45:41,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:45:41,692 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 28 treesize of output 16 [2022-11-16 11:45:41,977 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_1157 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1157) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1153 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1153) |c_#length|)) (exists ((v_ArrVal_1156 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1156) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-16 11:45:42,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:42,045 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:45:42,046 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 81 treesize of output 69 [2022-11-16 11:45:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:42,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:42,061 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:45:42,062 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 50 treesize of output 49 [2022-11-16 11:45:42,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:42,073 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 30 treesize of output 32 [2022-11-16 11:45:42,093 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:45:42,094 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:45:42,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:42,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:45:42,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:45:42,504 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 87 treesize of output 47 [2022-11-16 11:45:42,516 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-16 11:45:42,517 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 27 [2022-11-16 11:45:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:45:42,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:43,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86719166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:43,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:43,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2022-11-16 11:45:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877153459] [2022-11-16 11:45:43,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:43,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:45:43,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:45:43,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2022-11-16 11:45:43,232 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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:45:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:46,902 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-11-16 11:45:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:45:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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 49 [2022-11-16 11:45:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:46,904 INFO L225 Difference]: With dead ends: 175 [2022-11-16 11:45:46,904 INFO L226 Difference]: Without dead ends: 175 [2022-11-16 11:45:46,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=358, Invalid=4474, Unknown=2, NotChecked=136, Total=4970 [2022-11-16 11:45:46,906 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 159 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:46,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 2747 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1858 Invalid, 0 Unknown, 474 Unchecked, 1.5s Time] [2022-11-16 11:45:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-16 11:45:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 99. [2022-11-16 11:45:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 94 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:45:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2022-11-16 11:45:46,927 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 49 [2022-11-16 11:45:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:46,928 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2022-11-16 11:45:46,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 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:45:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2022-11-16 11:45:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:45:46,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:46,929 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:46,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:47,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:45:47,130 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash 241565308, now seen corresponding path program 1 times [2022-11-16 11:45:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:47,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817966546] [2022-11-16 11:45:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:45:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817966546] [2022-11-16 11:45:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817966546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116873644] [2022-11-16 11:45:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:48,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:48,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:45:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:49,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 11:45:49,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:49,504 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 11:45:49,504 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 19 treesize of output 16 [2022-11-16 11:45:49,645 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:45:50,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:50,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:45:50,019 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 51 treesize of output 18 [2022-11-16 11:45:50,025 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:45:50,252 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1329 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1329))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1330 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1330))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 11:45:50,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:50,337 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:45:50,338 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:45:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:50,346 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 62 treesize of output 58 [2022-11-16 11:45:50,388 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-16 11:45:50,388 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:45:50,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 81 treesize of output 57 [2022-11-16 11:45:50,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:50,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:45:50,961 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 29 [2022-11-16 11:45:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:45:51,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116873644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:51,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:51,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2022-11-16 11:45:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634073675] [2022-11-16 11:45:51,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:51,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 11:45:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 11:45:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2022-11-16 11:45:51,448 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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:45:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:52,919 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-11-16 11:45:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:45:52,920 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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 49 [2022-11-16 11:45:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:52,921 INFO L225 Difference]: With dead ends: 101 [2022-11-16 11:45:52,921 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 11:45:52,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=302, Invalid=3238, Unknown=4, NotChecked=116, Total=3660 [2022-11-16 11:45:52,922 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 49 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:52,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1117 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 689 Invalid, 0 Unknown, 119 Unchecked, 0.5s Time] [2022-11-16 11:45:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 11:45:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-11-16 11:45:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 94 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:45:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2022-11-16 11:45:52,926 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 49 [2022-11-16 11:45:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:52,926 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2022-11-16 11:45:52,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 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:45:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2022-11-16 11:45:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 11:45:52,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:52,931 INFO L195 NwaCegarLoop]: trace histogram [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:45:52,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:53,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:53,138 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash -365046387, now seen corresponding path program 1 times [2022-11-16 11:45:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:53,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689869470] [2022-11-16 11:45:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:45:53,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689869470] [2022-11-16 11:45:53,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689869470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455630858] [2022-11-16 11:45:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:53,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:53,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:45:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:53,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 11:45:53,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:54,257 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:45:54,338 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1507 (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_1507)))) is different from true [2022-11-16 11:45:54,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:54,364 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:45:54,409 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:45:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:45:54,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:54,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1511 (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| v_ArrVal_1511) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-16 11:45:54,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455630858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:54,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:54,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-16 11:45:54,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815769233] [2022-11-16 11:45:54,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:54,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:45:54,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:54,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:45:54,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-16 11:45:54,531 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 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:45:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:55,216 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-11-16 11:45:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:45:55,216 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 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 50 [2022-11-16 11:45:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:55,217 INFO L225 Difference]: With dead ends: 87 [2022-11-16 11:45:55,217 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 11:45:55,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-16 11:45:55,218 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 245 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:55,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 565 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 398 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2022-11-16 11:45:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 11:45:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-16 11:45:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 82 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:45:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2022-11-16 11:45:55,221 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 50 [2022-11-16 11:45:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:55,222 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2022-11-16 11:45:55,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 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:45:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-11-16 11:45:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:45:55,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:55,223 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:55,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:55,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:55,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 165492146, now seen corresponding path program 1 times [2022-11-16 11:45:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:55,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293065662] [2022-11-16 11:45:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:45:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:56,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293065662] [2022-11-16 11:45:56,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293065662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:56,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873121069] [2022-11-16 11:45:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:56,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:45:56,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:56,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:45:56,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:45:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:56,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 11:45:56,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:56,389 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:45:56,428 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:45:56,452 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1679 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1679))) is different from true [2022-11-16 11:45:56,462 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1679 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1679))) is different from true [2022-11-16 11:45:56,480 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:45:56,481 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 18 [2022-11-16 11:45:56,622 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:45:56,685 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:45:56,685 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:45:56,984 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:45:57,158 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1680 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1680))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1682 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1682) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-16 11:45:57,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:57,201 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:45:57,221 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 11:45:57,222 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:45:57,419 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:45:57,419 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 28 treesize of output 29 [2022-11-16 11:45:57,470 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:45:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-11-16 11:45:57,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:57,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 11:45:57,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 11:45:57,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873121069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:45:57,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:57,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2022-11-16 11:45:57,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116443020] [2022-11-16 11:45:57,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:57,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 11:45:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 11:45:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=20, NotChecked=420, Total=2162 [2022-11-16 11:45:57,719 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 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:45:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:58,803 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2022-11-16 11:45:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:45:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 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 51 [2022-11-16 11:45:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:58,805 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:45:58,805 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:45:58,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=2673, Unknown=20, NotChecked=550, Total=3540 [2022-11-16 11:45:58,807 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 306 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:58,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 911 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 893 Invalid, 0 Unknown, 421 Unchecked, 0.6s Time] [2022-11-16 11:45:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:45:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2022-11-16 11:45:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 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:45:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-11-16 11:45:58,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 51 [2022-11-16 11:45:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:58,812 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-11-16 11:45:58,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 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:45:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-11-16 11:45:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:45:58,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:58,813 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:45:58,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:45:59,019 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:45:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 165492147, now seen corresponding path program 1 times [2022-11-16 11:45:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:59,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088658167] [2022-11-16 11:45:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:45:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:45:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:46:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088658167] [2022-11-16 11:46:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088658167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626225867] [2022-11-16 11:46:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:00,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:00,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:00,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:46:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:46:00,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:01,006 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 34 treesize of output 22 [2022-11-16 11:46:01,012 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 21 treesize of output 13 [2022-11-16 11:46:01,019 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:46:01,025 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:46:01,230 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1857 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1857))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1860 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1860))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1861 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1861))))) is different from true [2022-11-16 11:46:01,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:01,293 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 40 treesize of output 38 [2022-11-16 11:46:01,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:01,308 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 22 treesize of output 24 [2022-11-16 11:46:01,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:01,316 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 31 treesize of output 31 [2022-11-16 11:46:01,326 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:46:01,326 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:46:01,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:01,605 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 45 treesize of output 44 [2022-11-16 11:46:01,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:01,612 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 35 treesize of output 35 [2022-11-16 11:46:01,688 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 32 treesize of output 20 [2022-11-16 11:46:01,696 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 28 treesize of output 16 [2022-11-16 11:46:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:46:01,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:01,863 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1863) |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_sll_append_~last~0#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1863) |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:46:01,886 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1863) |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_sll_append_#t~mem9#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:46:01,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (and (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) |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| .cse0 v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) |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:46:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626225867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:02,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:02,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2022-11-16 11:46:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687666315] [2022-11-16 11:46:02,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:02,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:46:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:46:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1510, Unknown=5, NotChecked=324, Total=1980 [2022-11-16 11:46:02,157 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 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:46:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:04,183 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2022-11-16 11:46:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:46:04,185 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 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:46:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:04,186 INFO L225 Difference]: With dead ends: 148 [2022-11-16 11:46:04,186 INFO L226 Difference]: Without dead ends: 148 [2022-11-16 11:46:04,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=315, Invalid=2999, Unknown=8, NotChecked=460, Total=3782 [2022-11-16 11:46:04,188 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 415 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:04,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1010 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 983 Invalid, 0 Unknown, 84 Unchecked, 0.7s Time] [2022-11-16 11:46:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-16 11:46:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2022-11-16 11:46:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3506493506493507) 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:46:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-16 11:46:04,193 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 51 [2022-11-16 11:46:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:04,193 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-16 11:46:04,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 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:46:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-16 11:46:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:46:04,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:04,195 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:04,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 11:46:04,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:46:04,406 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1444229747, now seen corresponding path program 2 times [2022-11-16 11:46:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:04,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788373201] [2022-11-16 11:46:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:46:07,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:07,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788373201] [2022-11-16 11:46:07,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788373201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:07,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633339461] [2022-11-16 11:46:07,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:46:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:07,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:07,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:46:07,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:46:07,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:46:07,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-16 11:46:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:07,582 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:46:07,794 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:46:07,803 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:46:08,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:08,458 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 11:46:08,458 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 24 treesize of output 27 [2022-11-16 11:46:08,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:08,479 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 11:46:08,479 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 24 treesize of output 27 [2022-11-16 11:46:08,506 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 11:46:08,506 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 19 treesize of output 16 [2022-11-16 11:46:08,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:08,786 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-16 11:46:08,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:08,798 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-16 11:46:09,343 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-16 11:46:09,343 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 60 [2022-11-16 11:46:09,354 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:46:09,354 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2022-11-16 11:46:09,521 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2050 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2049 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2049)) (<= (+ |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_2050)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:46:09,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:09,591 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:46:09,592 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 117 treesize of output 101 [2022-11-16 11:46:09,615 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:46:09,616 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:46:09,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:09,626 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-16 11:46:09,627 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 86 treesize of output 76 [2022-11-16 11:46:10,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:10,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:10,724 INFO L321 Elim1Store]: treesize reduction 89, result has 11.0 percent of original size [2022-11-16 11:46:10,724 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 10 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 100 [2022-11-16 11:46:10,752 INFO L321 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-11-16 11:46:10,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 37 [2022-11-16 11:46:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 11:46:10,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:11,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633339461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:11,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:11,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 54 [2022-11-16 11:46:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132953530] [2022-11-16 11:46:11,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:11,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 11:46:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 11:46:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3457, Unknown=1, NotChecked=118, Total=3782 [2022-11-16 11:46:11,909 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 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:46:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:14,170 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2022-11-16 11:46:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:46:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 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 53 [2022-11-16 11:46:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:14,173 INFO L225 Difference]: With dead ends: 119 [2022-11-16 11:46:14,173 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:46:14,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=314, Invalid=5091, Unknown=1, NotChecked=144, Total=5550 [2022-11-16 11:46:14,175 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:14,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1505 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 931 Invalid, 0 Unknown, 288 Unchecked, 0.8s Time] [2022-11-16 11:46:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:46:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-11-16 11:46:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.305263157894737) internal successors, (124), 111 states have internal predecessors, (124), 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:46:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2022-11-16 11:46:14,188 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 53 [2022-11-16 11:46:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:14,188 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2022-11-16 11:46:14,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 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:46:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-11-16 11:46:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:46:14,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:14,189 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:14,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:14,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:46:14,390 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash -445852738, now seen corresponding path program 1 times [2022-11-16 11:46:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:14,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031529050] [2022-11-16 11:46:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:46:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:15,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031529050] [2022-11-16 11:46:15,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031529050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:15,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112433587] [2022-11-16 11:46:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:15,845 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:15,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:46:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-16 11:46:16,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:16,112 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:46:16,171 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:46:16,199 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2226 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2226))) is different from true [2022-11-16 11:46:16,210 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2226 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2226))) is different from true [2022-11-16 11:46:16,231 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:46:16,232 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 18 [2022-11-16 11:46:16,369 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:46:16,454 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:46:16,455 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:46:16,758 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:46:16,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 8 treesize of output 4 [2022-11-16 11:46:16,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2227 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2227))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2228 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2228) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:16,877 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2229 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2229))) (exists ((v_ArrVal_2230 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2230)))) is different from true [2022-11-16 11:46:16,888 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2230 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2230))) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2229 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2229)))) is different from true [2022-11-16 11:46:16,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:16,911 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 15 treesize of output 17 [2022-11-16 11:46:16,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:16,921 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 14 treesize of output 16 [2022-11-16 11:46:17,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:17,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-11-16 11:46:17,292 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 55 treesize of output 53 [2022-11-16 11:46:17,382 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 52 treesize of output 36 [2022-11-16 11:46:17,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:17,542 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 45 treesize of output 20 [2022-11-16 11:46:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 16 not checked. [2022-11-16 11:46:17,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:18,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (or (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| v_ArrVal_2240))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| v_ArrVal_2241)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_2233) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 0)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| 0) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 11:46:18,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112433587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:18,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:18,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 51 [2022-11-16 11:46:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441380780] [2022-11-16 11:46:18,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:46:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:46:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2612, Unknown=10, NotChecked=642, Total=3422 [2022-11-16 11:46:18,241 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:20,574 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-11-16 11:46:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:46:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2022-11-16 11:46:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:20,576 INFO L225 Difference]: With dead ends: 106 [2022-11-16 11:46:20,576 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 11:46:20,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=373, Invalid=4752, Unknown=11, NotChecked=870, Total=6006 [2022-11-16 11:46:20,578 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 91 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 458 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:20,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1785 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 929 Invalid, 0 Unknown, 458 Unchecked, 0.7s Time] [2022-11-16 11:46:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 11:46:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-16 11:46:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 99 states have internal predecessors, (108), 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:46:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-16 11:46:20,584 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 54 [2022-11-16 11:46:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-16 11:46:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-16 11:46:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:46:20,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:20,585 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:20,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 11:46:20,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:20,792 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 579814440, now seen corresponding path program 1 times [2022-11-16 11:46:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:20,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72750362] [2022-11-16 11:46:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:46:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72750362] [2022-11-16 11:46:21,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72750362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440890182] [2022-11-16 11:46:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:21,914 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:21,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:46:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:22,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 11:46:22,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:22,473 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:46:22,756 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-16 11:46:22,756 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 27 treesize of output 27 [2022-11-16 11:46:22,762 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:46:22,767 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:46:22,976 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2413 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2413))) (exists ((v_ArrVal_2414 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2410 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2410))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:46:23,041 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 11:46:23,042 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 21 treesize of output 29 [2022-11-16 11:46:23,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:23,061 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:46:23,061 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 43 treesize of output 47 [2022-11-16 11:46:23,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:23,069 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 26 treesize of output 28 [2022-11-16 11:46:23,173 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 19 [2022-11-16 11:46:23,512 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-16 11:46:23,512 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 41 treesize of output 48 [2022-11-16 11:46:23,516 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 21 treesize of output 13 [2022-11-16 11:46:23,617 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-16 11:46:23,618 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 42 treesize of output 34 [2022-11-16 11:46:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:46:23,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:23,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 11:46:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440890182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:24,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:24,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2022-11-16 11:46:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078893567] [2022-11-16 11:46:24,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:24,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 11:46:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 11:46:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2315, Unknown=68, NotChecked=198, Total=2756 [2022-11-16 11:46:24,258 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:26,005 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-11-16 11:46:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:46:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-11-16 11:46:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:26,007 INFO L225 Difference]: With dead ends: 123 [2022-11-16 11:46:26,007 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 11:46:26,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=390, Invalid=4513, Unknown=75, NotChecked=278, Total=5256 [2022-11-16 11:46:26,009 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 101 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:26,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1072 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 897 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2022-11-16 11:46:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 11:46:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2022-11-16 11:46:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 103 states have internal predecessors, (113), 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:46:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-11-16 11:46:26,013 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 55 [2022-11-16 11:46:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:26,013 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-11-16 11:46:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-11-16 11:46:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:46:26,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:26,015 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:26,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:26,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:26,221 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash 579814441, now seen corresponding path program 1 times [2022-11-16 11:46:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:26,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033099404] [2022-11-16 11:46:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:46:27,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033099404] [2022-11-16 11:46:27,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033099404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573451454] [2022-11-16 11:46:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:27,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:27,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:46:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-16 11:46:27,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:27,965 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:46:28,009 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:46:28,113 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:46:28,113 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:46:28,458 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:46:28,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:28,785 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 30 treesize of output 17 [2022-11-16 11:46:28,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 7 treesize of output 3 [2022-11-16 11:46:28,966 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_2599 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2599))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2598 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2598))))) is different from true [2022-11-16 11:46:29,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:29,005 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:46:29,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:29,020 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:46:29,021 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 36 treesize of output 40 [2022-11-16 11:46:29,034 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:46:29,035 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:46:29,782 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-16 11:46:29,782 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 120 treesize of output 105 [2022-11-16 11:46:29,801 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:46:29,801 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 97 treesize of output 75 [2022-11-16 11:46:29,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:29,843 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:46:29,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 23 [2022-11-16 11:46:29,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:29,978 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 52 treesize of output 31 [2022-11-16 11:46:29,983 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 26 treesize of output 14 [2022-11-16 11:46:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:46:30,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:30,285 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_2602 (Array Int Int)) (v_ArrVal_2601 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2601)) |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_sll_append_~last~0#1.base| v_ArrVal_2602) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2601 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2601)) |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:46:30,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:30,923 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 121 treesize of output 125 [2022-11-16 11:46:32,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573451454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:32,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:32,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2022-11-16 11:46:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056737786] [2022-11-16 11:46:32,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 11:46:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 11:46:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=4166, Unknown=4, NotChecked=262, Total=4692 [2022-11-16 11:46:32,277 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:35,616 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2022-11-16 11:46:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 11:46:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-11-16 11:46:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:35,618 INFO L225 Difference]: With dead ends: 196 [2022-11-16 11:46:35,619 INFO L226 Difference]: Without dead ends: 196 [2022-11-16 11:46:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=696, Invalid=9607, Unknown=7, NotChecked=402, Total=10712 [2022-11-16 11:46:35,622 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 657 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:35,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1135 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1377 Invalid, 0 Unknown, 161 Unchecked, 0.9s Time] [2022-11-16 11:46:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-16 11:46:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 114. [2022-11-16 11:46:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2717391304347827) 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:46:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-11-16 11:46:35,635 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 55 [2022-11-16 11:46:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:35,635 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-11-16 11:46:35,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:46:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-11-16 11:46:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:46:35,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:35,636 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:35,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:35,843 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1106400888, now seen corresponding path program 1 times [2022-11-16 11:46:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277116574] [2022-11-16 11:46:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:46:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277116574] [2022-11-16 11:46:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277116574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:38,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932774751] [2022-11-16 11:46:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:38,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:38,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:38,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:38,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:46:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:39,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-16 11:46:39,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:39,506 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:46:39,704 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:46:39,705 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:46:39,892 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:46:40,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:40,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:40,439 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 67 treesize of output 20 [2022-11-16 11:46:40,445 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:46:40,720 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2781 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2781) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2782 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2782) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:46:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:40,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 80 treesize of output 74 [2022-11-16 11:46:40,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:40,774 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:46:40,774 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 67 [2022-11-16 11:46:40,800 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:46:40,800 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:46:41,652 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:46:41,653 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 100 treesize of output 85 [2022-11-16 11:46:41,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:41,667 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 94 treesize of output 89 [2022-11-16 11:46:41,817 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 81 treesize of output 57 [2022-11-16 11:46:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:42,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:42,085 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 20 [2022-11-16 11:46:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:46:42,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:42,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2783))) (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_sll_append_~last~0#1.base| v_ArrVal_2784) |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:46:42,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2783))) (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_sll_append_#t~mem10#1.base| v_ArrVal_2784) |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:46:42,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (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| .cse1 v_ArrVal_2784) |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:46:42,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (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| .cse1 v_ArrVal_2784) |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:46:42,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (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| .cse1 v_ArrVal_2784) |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:46:42,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932774751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:42,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:42,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31] total 63 [2022-11-16 11:46:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371457917] [2022-11-16 11:46:42,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-16 11:46:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-16 11:46:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4101, Unknown=7, NotChecked=798, Total=5112 [2022-11-16 11:46:42,653 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 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:46:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:49,189 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-11-16 11:46:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:46:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 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 58 [2022-11-16 11:46:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:49,193 INFO L225 Difference]: With dead ends: 116 [2022-11-16 11:46:49,193 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 11:46:49,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=662, Invalid=8285, Unknown=7, NotChecked=1146, Total=10100 [2022-11-16 11:46:49,194 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 254 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:49,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1816 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1877 Invalid, 0 Unknown, 168 Unchecked, 1.5s Time] [2022-11-16 11:46:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 11:46:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-11-16 11:46:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 108 states have internal predecessors, (118), 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:46:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-11-16 11:46:49,199 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 58 [2022-11-16 11:46:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:49,200 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-11-16 11:46:49,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 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:46:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-11-16 11:46:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 11:46:49,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:49,201 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:49,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-16 11:46:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:49,407 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1990872485, now seen corresponding path program 1 times [2022-11-16 11:46:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102001071] [2022-11-16 11:46:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:49,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:46:49,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:49,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102001071] [2022-11-16 11:46:49,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102001071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:49,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:49,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:46:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733015275] [2022-11-16 11:46:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:49,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:46:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:46:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:49,562 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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:46:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:49,677 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-11-16 11:46:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:46:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 61 [2022-11-16 11:46:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:49,678 INFO L225 Difference]: With dead ends: 117 [2022-11-16 11:46:49,678 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 11:46:49,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:46:49,679 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:49,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 267 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:46:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 11:46:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2022-11-16 11:46:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 107 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:46:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-11-16 11:46:49,682 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 61 [2022-11-16 11:46:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:49,683 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-11-16 11:46:49,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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:46:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-11-16 11:46:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:46:49,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:49,684 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:46:49,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:46:49,684 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:46:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860704, now seen corresponding path program 1 times [2022-11-16 11:46:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:49,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239436378] [2022-11-16 11:46:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:46:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:46:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:46:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:53,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239436378] [2022-11-16 11:46:53,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239436378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:53,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500477506] [2022-11-16 11:46:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:53,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:53,459 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:53,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:46:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:53,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-16 11:46:53,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:53,787 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:46:53,873 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:46:54,091 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:46:54,091 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:46:54,481 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:46:54,571 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 11 treesize of output 7 [2022-11-16 11:46:54,753 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:46:54,753 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 16 treesize of output 18 [2022-11-16 11:46:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:54,970 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:46:54,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:46:55,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:55,585 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 65 treesize of output 32 [2022-11-16 11:46:55,596 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:46:55,865 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3074 (Array Int Int)) (v_ArrVal_3075 (Array Int Int)) (v_ArrVal_3076 (Array Int Int)) (|node_create_~temp~0#1.base| 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_3076)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3074) |c_#memory_int|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3075) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:46:55,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:55,968 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:46:55,969 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 71 treesize of output 63 [2022-11-16 11:46:55,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:55,987 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:46:56,001 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:46:56,002 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 15 treesize of output 15 [2022-11-16 11:46:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:56,009 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 14 treesize of output 16 [2022-11-16 11:46:57,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:46:57,187 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-16 11:46:57,187 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 160 treesize of output 71 [2022-11-16 11:46:57,197 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:46:57,208 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:46:57,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:57,358 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:46:57,365 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:46:57,587 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:46:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 11 refuted. 9 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 11:46:57,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:57,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 Int) (v_ArrVal_3080 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3080) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_3078)) |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_sll_append_~last~0#1.base| v_ArrVal_3077) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 11:46:59,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500477506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:59,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:59,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 67 [2022-11-16 11:46:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955717612] [2022-11-16 11:46:59,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:59,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-16 11:46:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-16 11:46:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=5020, Unknown=8, NotChecked=286, Total=5550 [2022-11-16 11:46:59,263 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 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:47:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:04,793 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-11-16 11:47:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:47:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 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 63 [2022-11-16 11:47:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:04,795 INFO L225 Difference]: With dead ends: 150 [2022-11-16 11:47:04,795 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 11:47:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2248 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=629, Invalid=9673, Unknown=8, NotChecked=402, Total=10712 [2022-11-16 11:47:04,796 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 342 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1717 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1802 Invalid, 0 Unknown, 260 Unchecked, 1.5s Time] [2022-11-16 11:47:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 11:47:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2022-11-16 11:47:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 113 states have internal predecessors, (122), 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:47:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2022-11-16 11:47:04,801 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 63 [2022-11-16 11:47:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:04,802 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2022-11-16 11:47:04,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 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:47:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2022-11-16 11:47:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:47:04,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:04,803 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:47:04,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 11:47:05,009 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:47:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860700, now seen corresponding path program 1 times [2022-11-16 11:47:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:05,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630183709] [2022-11-16 11:47:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:47:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:07,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:07,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630183709] [2022-11-16 11:47:07,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630183709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:07,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749570951] [2022-11-16 11:47:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:07,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:07,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:07,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:07,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:47:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:08,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-16 11:47:08,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:08,217 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:47:08,272 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:47:08,388 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:47:08,388 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:47:08,714 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:47:08,715 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:47:08,843 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:47:09,240 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-16 11:47:09,241 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 50 treesize of output 32 [2022-11-16 11:47:09,247 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 23 treesize of output 15 [2022-11-16 11:47:09,252 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:47:09,513 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3264 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3264) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3265 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3265))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:47:09,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:09,565 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:47:09,565 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 56 treesize of output 54 [2022-11-16 11:47:09,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:09,573 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 54 treesize of output 52 [2022-11-16 11:47:09,582 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:47:09,582 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:47:10,234 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:47:10,234 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 100 treesize of output 85 [2022-11-16 11:47:10,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:47:10,253 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 87 treesize of output 84 [2022-11-16 11:47:10,373 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 74 treesize of output 54 [2022-11-16 11:47:10,757 INFO L321 Elim1Store]: treesize reduction 3, result has 91.9 percent of original size [2022-11-16 11:47:10,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 53 [2022-11-16 11:47:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 11:47:10,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:47:11,522 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-16 11:47:11,523 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 28 treesize of output 27 [2022-11-16 11:47:11,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3267))) (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_24| 4)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0))) is different from false [2022-11-16 11:47:12,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (or (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (= .cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3267))) (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_24| 4)))))) is different from false [2022-11-16 11:47:12,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749570951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:12,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:47:12,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2022-11-16 11:47:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388316600] [2022-11-16 11:47:12,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 11:47:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 11:47:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=5117, Unknown=70, NotChecked=438, Total=5852 [2022-11-16 11:47:12,525 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 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:47:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:17,225 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2022-11-16 11:47:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:47:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 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 63 [2022-11-16 11:47:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:17,227 INFO L225 Difference]: With dead ends: 163 [2022-11-16 11:47:17,227 INFO L226 Difference]: Without dead ends: 163 [2022-11-16 11:47:17,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=592, Invalid=9250, Unknown=70, NotChecked=594, Total=10506 [2022-11-16 11:47:17,228 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 390 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:17,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1700 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2271 Invalid, 0 Unknown, 397 Unchecked, 1.7s Time] [2022-11-16 11:47:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-16 11:47:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 121. [2022-11-16 11:47:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 114 states have internal predecessors, (124), 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:47:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2022-11-16 11:47:17,233 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 63 [2022-11-16 11:47:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:17,233 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2022-11-16 11:47:17,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 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:47:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2022-11-16 11:47:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:47:17,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:17,234 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:47:17,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-16 11:47:17,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:47:17,441 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:47:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860701, now seen corresponding path program 1 times [2022-11-16 11:47:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867856325] [2022-11-16 11:47:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:47:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:20,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867856325] [2022-11-16 11:47:20,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867856325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:20,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265754056] [2022-11-16 11:47:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:20,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:20,855 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:20,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:47:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:21,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-16 11:47:21,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:21,661 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:47:21,852 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:47:21,852 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:47:22,033 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:47:22,050 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:47:22,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:22,570 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 48 treesize of output 23 [2022-11-16 11:47:22,575 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:47:22,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:22,581 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:47:22,850 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_3448 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3448))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3449 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3449) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-16 11:47:22,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:22,895 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:47:22,896 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 56 treesize of output 52 [2022-11-16 11:47:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:22,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:22,914 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:47:22,914 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:47:22,932 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:47:22,933 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:47:23,796 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:47:23,797 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 116 treesize of output 97 [2022-11-16 11:47:23,820 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:47:23,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 74 treesize of output 70 [2022-11-16 11:47:24,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:47:24,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:47:24,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:24,402 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-16 11:47:24,402 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:47:24,425 INFO L321 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-11-16 11:47:24,425 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 48 treesize of output 31 [2022-11-16 11:47:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:47:24,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:47:25,375 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3450 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3451 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_3450 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3451 (Array Int Int))) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse6 4)) 4))) (not (<= 0 .cse6))))))) is different from false [2022-11-16 11:47:25,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:25,407 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 115 treesize of output 119 [2022-11-16 11:47:25,490 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_33))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse3 4)) 4)) (not (<= 0 .cse3)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_32))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (< (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 1))))))) is different from false [2022-11-16 11:47:25,524 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3450))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse1 4)) 4)) (not (<= 0 .cse1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_32))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2)) (< (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse2)) (+ |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_33))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse5)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (not (<= 0 .cse5)))))) is different from false [2022-11-16 11:47:25,559 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_32))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse2 4)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 1)) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3450))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) 4)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse7 4))) (not (<= 0 .cse7)))))))) is different from false [2022-11-16 11:47:25,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) .cse5))) (and (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3450))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (<= 0 (+ (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 4)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3)) (< (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse3)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) .cse5) 1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse7))) (not (<= 0 .cse7)))))))) is different from false [2022-11-16 11:47:25,660 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (and (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3450))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (<= 0 (+ 4 (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0)))))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse4))) (not (<= 0 .cse4))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse6)) (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 1)) (not (<= 0 .cse6))))))))) is different from false [2022-11-16 11:47:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265754056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:26,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:47:26,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 68 [2022-11-16 11:47:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519580860] [2022-11-16 11:47:26,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:26,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-16 11:47:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-16 11:47:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5494, Unknown=8, NotChecked=1078, Total=6806 [2022-11-16 11:47:26,323 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 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:47:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:34,890 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2022-11-16 11:47:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 11:47:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 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 63 [2022-11-16 11:47:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:34,891 INFO L225 Difference]: With dead ends: 150 [2022-11-16 11:47:34,891 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 11:47:34,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1945 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=894, Invalid=10256, Unknown=8, NotChecked=1498, Total=12656 [2022-11-16 11:47:34,893 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 554 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:34,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1939 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2661 Invalid, 0 Unknown, 237 Unchecked, 2.4s Time] [2022-11-16 11:47:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 11:47:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2022-11-16 11:47:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 116 states have internal predecessors, (126), 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:47:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2022-11-16 11:47:34,898 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 63 [2022-11-16 11:47:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2022-11-16 11:47:34,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 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:47:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-11-16 11:47:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:47:34,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:34,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:34,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:35,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:47:35,107 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:47:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1590487563, now seen corresponding path program 3 times [2022-11-16 11:47:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:35,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915246338] [2022-11-16 11:47:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 11:47:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:47:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:47:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915246338] [2022-11-16 11:47:35,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915246338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:35,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277560192] [2022-11-16 11:47:35,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:47:35,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:35,229 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:35,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:47:35,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:47:35,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:47:35,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:47:35,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:47:35,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:47:35,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277560192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:35,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:47:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-16 11:47:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121301245] [2022-11-16 11:47:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:35,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:47:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:47:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:47:35,851 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:47:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:35,871 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-16 11:47:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:47:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2022-11-16 11:47:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:35,873 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:47:35,873 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:47:35,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:47:35,874 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 106 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:35,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 91 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:47:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:47:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-16 11:47:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:47:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-16 11:47:35,877 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 66 [2022-11-16 11:47:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:35,878 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-16 11:47:35,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:47:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-16 11:47:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:47:35,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:35,879 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:47:35,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-16 11:47:36,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:47:36,086 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:47:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1241889524, now seen corresponding path program 1 times [2022-11-16 11:47:36,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:36,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117913586] [2022-11-16 11:47:36,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:47:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:39,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117913586] [2022-11-16 11:47:39,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117913586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:39,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103718674] [2022-11-16 11:47:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:39,180 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:39,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:47:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:39,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-16 11:47:39,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:39,991 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:47:40,189 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:47:40,189 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:47:40,368 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:47:40,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:40,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:40,875 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 49 treesize of output 16 [2022-11-16 11:47:40,878 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:47:41,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:41,417 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 62 treesize of output 58 [2022-11-16 11:47:41,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:41,435 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:47:41,436 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-16 11:47:41,447 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:47:41,447 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:47:42,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:42,546 INFO L321 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-11-16 11:47:42,546 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 68 [2022-11-16 11:47:42,569 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:47:42,570 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 195 treesize of output 171 [2022-11-16 11:47:43,266 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:47:43,267 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 209 treesize of output 126 [2022-11-16 11:47:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:43,868 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-16 11:47:43,869 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 106 treesize of output 32 [2022-11-16 11:47:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:47:43,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:47:46,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103718674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:46,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:47:46,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 72 [2022-11-16 11:47:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034400954] [2022-11-16 11:47:46,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:46,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:47:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:46,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:47:46,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=6869, Unknown=36, NotChecked=0, Total=7140 [2022-11-16 11:47:46,117 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 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:47:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:52,581 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-16 11:47:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:47:52,581 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 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 67 [2022-11-16 11:47:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:52,582 INFO L225 Difference]: With dead ends: 84 [2022-11-16 11:47:52,582 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 11:47:52,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=546, Invalid=12758, Unknown=36, NotChecked=0, Total=13340 [2022-11-16 11:47:52,584 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 87 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:52,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1782 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1623 Invalid, 0 Unknown, 208 Unchecked, 1.2s Time] [2022-11-16 11:47:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 11:47:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-16 11:47:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:47:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-16 11:47:52,588 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 67 [2022-11-16 11:47:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:52,588 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-16 11:47:52,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 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:47:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-16 11:47:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 11:47:52,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:52,589 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:47:52,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:52,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:47:52,796 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:47:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash -502226385, now seen corresponding path program 1 times [2022-11-16 11:47:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060707320] [2022-11-16 11:47:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:47:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:56,988 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:47:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:56,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060707320] [2022-11-16 11:47:56,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060707320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:56,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198540026] [2022-11-16 11:47:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:56,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:56,990 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:56,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:47:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:57,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-16 11:47:57,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:57,502 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:47:57,905 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:47:58,169 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:47:58,172 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:47:58,683 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:47:58,684 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 14 treesize of output 20 [2022-11-16 11:47:58,692 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:47:58,720 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 11:47:58,720 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 19 treesize of output 16 [2022-11-16 11:47:59,007 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:47:59,014 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 20 treesize of output 22 [2022-11-16 11:47:59,019 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:47:59,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:59,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:59,809 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 139 treesize of output 66 [2022-11-16 11:47:59,824 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:47:59,824 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 58 treesize of output 25 [2022-11-16 11:47:59,831 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:47:59,836 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:48:00,186 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_4032 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4032))) (exists ((v_ArrVal_4033 (Array Int Int))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_4033) |c_#memory_int|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4034 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4034))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:48:00,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:00,284 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:48:00,285 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 145 treesize of output 125 [2022-11-16 11:48:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:00,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:00,299 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:48:00,299 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 150 treesize of output 127 [2022-11-16 11:48:00,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:00,318 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 42 treesize of output 44 [2022-11-16 11:48:00,340 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:48:00,340 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:48:01,474 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:48:01,474 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 206 treesize of output 171 [2022-11-16 11:48:01,497 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:48:01,498 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 200 treesize of output 168 [2022-11-16 11:48:01,509 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 91 treesize of output 76 [2022-11-16 11:48:02,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:02,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:02,233 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 137 treesize of output 94 [2022-11-16 11:48:02,263 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-16 11:48:02,263 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 86 treesize of output 63 [2022-11-16 11:48:02,933 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:48:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:48:03,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:03,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_4035))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_4036))) (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_30| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_4038)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (< (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_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))) is different from false [2022-11-16 11:48:03,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_4035))) (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_30|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_4036))) (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 |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (+ 4 |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) v_ArrVal_4038)) (select (select .cse1 .cse2) .cse3)) (select (select .cse0 .cse2) .cse3))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))) is different from false [2022-11-16 11:48:03,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4035))) (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_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4036))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2) 4) v_ArrVal_4038)) (select (select .cse3 .cse4) .cse5)) (select (select .cse0 .cse4) .cse5)))))))))) is different from false [2022-11-16 11:48:06,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198540026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:06,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:48:06,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37] total 74 [2022-11-16 11:48:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012745932] [2022-11-16 11:48:06,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:06,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 11:48:06,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 11:48:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=6323, Unknown=67, NotChecked=652, Total=7310 [2022-11-16 11:48:06,369 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 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:48:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:13,057 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-16 11:48:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:48:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 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 69 [2022-11-16 11:48:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:13,058 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:48:13,059 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:48:13,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 112 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=547, Invalid=11392, Unknown=67, NotChecked=876, Total=12882 [2022-11-16 11:48:13,060 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 92 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:13,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1673 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2003 Invalid, 0 Unknown, 404 Unchecked, 1.7s Time] [2022-11-16 11:48:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:48:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-16 11:48:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:48:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-11-16 11:48:13,064 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 69 [2022-11-16 11:48:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:13,064 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-11-16 11:48:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 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:48:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-11-16 11:48:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 11:48:13,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:13,066 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:48:13,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:13,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:48:13,271 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:48:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -502226389, now seen corresponding path program 2 times [2022-11-16 11:48:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:13,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226477221] [2022-11-16 11:48:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:15,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:48:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:48:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:48:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:16,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226477221] [2022-11-16 11:48:16,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226477221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:16,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537511458] [2022-11-16 11:48:16,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:48:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:16,639 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:16,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:48:17,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:48:17,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:48:17,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-16 11:48:17,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:17,110 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:48:17,871 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:48:17,875 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:48:18,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:18,509 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:48:18,527 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 11:48:18,527 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:48:18,539 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:48:18,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:18,550 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 14 treesize of output 16 [2022-11-16 11:48:19,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:19,610 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 17 treesize of output 21 [2022-11-16 11:48:20,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:20,056 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-16 11:48:20,056 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 213 treesize of output 106 [2022-11-16 11:48:20,087 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-16 11:48:20,087 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 223 treesize of output 140 [2022-11-16 11:48:21,165 INFO L321 Elim1Store]: treesize reduction 52, result has 38.8 percent of original size [2022-11-16 11:48:21,165 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 284 treesize of output 238 [2022-11-16 11:48:22,570 INFO L321 Elim1Store]: treesize reduction 60, result has 69.5 percent of original size [2022-11-16 11:48:22,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 208 treesize of output 214 [2022-11-16 11:48:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:48:30,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:38,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537511458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:38,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:48:38,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 31] total 72 [2022-11-16 11:48:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591564363] [2022-11-16 11:48:38,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:38,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-16 11:48:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-16 11:48:38,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7759, Unknown=2, NotChecked=0, Total=8010 [2022-11-16 11:48:38,042 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:48:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:45,700 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-16 11:48:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:48:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2022-11-16 11:48:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:45,702 INFO L225 Difference]: With dead ends: 86 [2022-11-16 11:48:45,702 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 11:48:45,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=534, Invalid=14468, Unknown=4, NotChecked=0, Total=15006 [2022-11-16 11:48:45,703 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:45,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1750 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1823 Invalid, 0 Unknown, 398 Unchecked, 1.4s Time] [2022-11-16 11:48:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 11:48:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-16 11:48:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:48:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-16 11:48:45,707 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 69 [2022-11-16 11:48:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:45,707 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-16 11:48:45,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:48:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-16 11:48:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 11:48:45,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:45,708 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 11:48:45,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:45,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:45,914 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:48:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -502226388, now seen corresponding path program 2 times [2022-11-16 11:48:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721886315] [2022-11-16 11:48:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:48:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:48:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:48:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:50,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721886315] [2022-11-16 11:48:50,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721886315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:50,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084477289] [2022-11-16 11:48:50,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:48:50,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:50,307 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:50,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:48:50,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:48:50,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:48:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 198 conjunts are in the unsatisfiable core [2022-11-16 11:48:50,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:50,772 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:48:50,772 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 18 [2022-11-16 11:48:50,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:50,883 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 19 [2022-11-16 11:48:51,146 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-11-16 11:48:51,146 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 20 treesize of output 26 [2022-11-16 11:48:51,676 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:48:51,683 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:48:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,807 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 20 [2022-11-16 11:48:51,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,815 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 20 [2022-11-16 11:48:51,967 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:48:51,968 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:48:52,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:48:52,300 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 13 [2022-11-16 11:48:52,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:48:52,313 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 21 treesize of output 13 [2022-11-16 11:48:53,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:53,047 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 76 treesize of output 35 [2022-11-16 11:48:53,055 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:48:53,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,061 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:48:53,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,806 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 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:48:53,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,830 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:48:53,830 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 84 treesize of output 70 [2022-11-16 11:48:53,868 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:48:53,868 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:48:56,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:56,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:48:56,205 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-16 11:48:56,205 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 208 treesize of output 106 [2022-11-16 11:48:56,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:56,247 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-11-16 11:48:56,249 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 4 case distinctions, treesize of input 230 treesize of output 160 [2022-11-16 11:48:58,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:58,372 INFO L321 Elim1Store]: treesize reduction 63, result has 11.3 percent of original size [2022-11-16 11:48:58,373 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 285 treesize of output 111 [2022-11-16 11:48:58,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:58,395 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-11-16 11:48:58,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 32 [2022-11-16 11:48:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:48:58,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:03,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:03,789 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 1907 treesize of output 1911 [2022-11-16 11:49:19,859 WARN L233 SmtUtils]: Spent 10.33s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:19,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084477289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:19,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:49:19,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 84 [2022-11-16 11:49:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733233357] [2022-11-16 11:49:19,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:19,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-16 11:49:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-16 11:49:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=10806, Unknown=0, NotChecked=0, Total=11130 [2022-11-16 11:49:19,865 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 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:49:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:38,103 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-11-16 11:49:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 11:49:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 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 69 [2022-11-16 11:49:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:38,108 INFO L225 Difference]: With dead ends: 121 [2022-11-16 11:49:38,108 INFO L226 Difference]: Without dead ends: 121 [2022-11-16 11:49:38,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=735, Invalid=19571, Unknown=0, NotChecked=0, Total=20306 [2022-11-16 11:49:38,109 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 206 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:38,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2041 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2590 Invalid, 0 Unknown, 343 Unchecked, 3.1s Time] [2022-11-16 11:49:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-16 11:49:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2022-11-16 11:49:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:49:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-11-16 11:49:38,112 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 69 [2022-11-16 11:49:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:38,113 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-11-16 11:49:38,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 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:49:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-11-16 11:49:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:49:38,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:38,114 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, 1, 1, 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:49:38,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-16 11:49:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:38,320 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:49:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1197977859, now seen corresponding path program 2 times [2022-11-16 11:49:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783751985] [2022-11-16 11:49:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:49:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:49:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:49:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:49:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:46,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783751985] [2022-11-16 11:49:46,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783751985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:46,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089697780] [2022-11-16 11:49:46,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:49:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:46,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:46,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:49:46,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:49:46,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:49:46,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-16 11:49:46,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:46,684 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:46,822 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:49:47,253 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:47,254 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:47,795 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:49:47,891 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 11:49:47,891 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 22 treesize of output 33 [2022-11-16 11:49:48,283 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:49:48,296 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:49:49,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:49,264 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 70 treesize of output 33 [2022-11-16 11:49:49,271 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 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:49:49,277 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:49:49,816 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:49:50,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:50,278 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:49:50,278 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 64 [2022-11-16 11:49:50,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:50,311 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:49:50,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:49:50,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:50,339 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 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:49:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:52,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:52,341 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-16 11:49:52,341 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 102 [2022-11-16 11:49:52,353 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:49:52,354 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 149 [2022-11-16 11:49:52,384 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 50 treesize of output 52 [2022-11-16 11:49:55,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:55,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:55,120 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-16 11:49:55,120 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 270 treesize of output 114 [2022-11-16 11:49:55,147 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-11-16 11:49:55,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 32 [2022-11-16 11:49:55,862 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:49:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:49:55,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:59,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:59,826 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 1299 treesize of output 1300 [2022-11-16 11:49:59,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:59,880 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 3221 treesize of output 3224 [2022-11-16 11:49:59,892 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 1290 treesize of output 659 [2022-11-16 11:50:00,163 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 0)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (<= (+ (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 1) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse18 (select (select .cse15 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse19 (+ (select (select .cse17 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse8 (select (select .cse15 .cse18) .cse19)) (.cse16 (+ (select (select .cse17 .cse18) .cse19) 4))) (let ((.cse14 (store .cse17 .cse8 (store (select .cse17 .cse8) .cse16 0)))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (store .cse15 .cse8 (store (select .cse15 .cse8) .cse16 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ .cse13 4))) (let ((.cse12 (select (select .cse14 .cse10) .cse11))) (or (not (= .cse8 (select (select .cse9 (select (select .cse9 .cse10) .cse11)) (+ .cse12 4)))) (not (<= 0 .cse13)) (<= (+ .cse12 1) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse30 (select (select .cse26 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse31 (+ (select (select .cse29 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse27 (select (select .cse26 .cse30) .cse31)) (.cse28 (+ (select (select .cse29 .cse30) .cse31) 4))) (let ((.cse25 (store .cse29 .cse27 (store (select .cse29 .cse27) .cse28 0)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (+ .cse20 4))) (let ((.cse21 (select (select .cse25 .cse23) .cse24))) (or (not (<= 0 .cse20)) (<= (+ .cse21 1) 0) (= (select (select .cse22 (select (select .cse22 .cse23) .cse24)) (+ .cse21 4)) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse38 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse42 (select (select .cse38 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse43 (+ (select (select .cse41 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse39 (select (select .cse38 .cse42) .cse43)) (.cse40 (+ (select (select .cse41 .cse42) .cse43) 4))) (let ((.cse34 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0)))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ .cse32 4))) (let ((.cse33 (select (select .cse34 .cse36) .cse37))) (or (not (<= 0 .cse32)) (<= (+ .cse33 1) 0) (= (select (select .cse34 (select (select .cse35 .cse36) .cse37)) (+ .cse33 4)) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0))))) is different from false [2022-11-16 11:50:00,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089697780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:00,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:00,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 38] total 82 [2022-11-16 11:50:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91092997] [2022-11-16 11:50:00,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-16 11:50:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-16 11:50:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8470, Unknown=3, NotChecked=184, Total=8930 [2022-11-16 11:50:00,200 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 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:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:15,515 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-11-16 11:50:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:50:15,516 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 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 73 [2022-11-16 11:50:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:15,517 INFO L225 Difference]: With dead ends: 121 [2022-11-16 11:50:15,517 INFO L226 Difference]: Without dead ends: 121 [2022-11-16 11:50:15,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=683, Invalid=14080, Unknown=3, NotChecked=240, Total=15006 [2022-11-16 11:50:15,519 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 269 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:15,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1578 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2162 Invalid, 0 Unknown, 310 Unchecked, 2.9s Time] [2022-11-16 11:50:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-16 11:50:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2022-11-16 11:50:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.180722891566265) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-11-16 11:50:15,523 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 73 [2022-11-16 11:50:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:15,523 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-11-16 11:50:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 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:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-11-16 11:50:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:50:15,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:15,524 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, 1, 1, 1, 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:50:15,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:15,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 11:50:15,731 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:50:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1517390927, now seen corresponding path program 1 times [2022-11-16 11:50:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013740174] [2022-11-16 11:50:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:50:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:50:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:50:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:15,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013740174] [2022-11-16 11:50:15,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013740174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705414681] [2022-11-16 11:50:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:15,973 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:15,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:50:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:50:16,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:50:16,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:50:16,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705414681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:16,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:16,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-16 11:50:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732351286] [2022-11-16 11:50:16,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:16,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:50:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:50:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:50:16,955 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:17,158 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-16 11:50:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:50:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-11-16 11:50:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:17,159 INFO L225 Difference]: With dead ends: 117 [2022-11-16 11:50:17,159 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 11:50:17,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:50:17,160 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 151 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:17,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 469 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:50:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 11:50:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-11-16 11:50:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-11-16 11:50:17,163 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 74 [2022-11-16 11:50:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:17,164 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-11-16 11:50:17,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-11-16 11:50:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:50:17,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:17,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-16 11:50:17,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-16 11:50:17,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:50:17,371 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:50:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 248336510, now seen corresponding path program 2 times [2022-11-16 11:50:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:17,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998987019] [2022-11-16 11:50:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:50:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:50:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:50:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:23,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998987019] [2022-11-16 11:50:23,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998987019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:23,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407907997] [2022-11-16 11:50:23,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:23,728 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:23,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:50:24,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:24,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:24,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-16 11:50:24,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:24,161 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:24,295 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:24,392 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:24,661 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:24,661 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:50:25,767 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:50:25,767 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:50:25,812 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:25,813 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:50:26,159 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:50:26,175 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:50:27,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:27,127 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 75 treesize of output 34 [2022-11-16 11:50:27,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:27,138 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:50:28,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:28,312 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 35 treesize of output 41 [2022-11-16 11:50:28,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:28,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:28,334 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 11:50:28,335 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 64 [2022-11-16 11:50:28,362 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:50:28,362 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:50:28,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-16 11:50:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:30,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:30,575 INFO L321 Elim1Store]: treesize reduction 137, result has 18.5 percent of original size [2022-11-16 11:50:30,575 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 96 [2022-11-16 11:50:30,615 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-16 11:50:30,615 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 6 case distinctions, treesize of input 352 treesize of output 296 [2022-11-16 11:50:35,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:35,220 INFO L321 Elim1Store]: treesize reduction 90, result has 12.6 percent of original size [2022-11-16 11:50:35,221 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 471 treesize of output 123 [2022-11-16 11:50:35,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:35,251 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 11:50:35,251 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 33 [2022-11-16 11:50:35,257 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 23 treesize of output 15 [2022-11-16 11:50:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 36 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:35,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:51,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4995 Int)) (or (not (<= v_ArrVal_4995 8)) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| Int)) (or (forall ((v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4996 Int) (v_ArrVal_4997 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4996))) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4997)))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse13 (+ (select (select .cse11 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse10 (select (select .cse9 .cse12) .cse13))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_4981))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (select (select .cse11 .cse12) .cse13) 4) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|)))) (let ((.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| v_ArrVal_4995)) (.cse3 (select (select .cse2 .cse7) .cse8)) (.cse4 (select (select .cse6 .cse7) .cse8))) (or (forall ((v_subst_3 Int)) (let ((.cse1 (select (select .cse2 .cse3) (+ 4 .cse4)))) (or (<= (+ v_subst_3 1) 0) (not (<= (+ 8 v_subst_3) (select .cse0 .cse1))) (= (select (select .cse2 .cse1) (+ 4 v_subst_3)) 0)))) (not (<= 0 .cse5)) (not (<= (+ 8 .cse4) (select .cse0 .cse3))) (not (<= 0 .cse4))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 0)) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_4995 Int)) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 0)) (forall ((v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4996 Int) (v_ArrVal_4997 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4996))) (.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4997)))) (let ((.cse26 (select (select .cse23 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse24 (select (select .cse23 .cse26) .cse27))) (let ((.cse17 (store .cse25 .cse24 v_ArrVal_4981))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) (+ (select (select .cse25 .cse26) .cse27) 4) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|)))) (let ((.cse21 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (+ .cse14 4))) (let ((.cse15 (store |c_#length| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| v_ArrVal_4995)) (.cse19 (select (select .cse18 .cse21) .cse22)) (.cse20 (select (select .cse17 .cse21) .cse22))) (or (not (<= 0 .cse14)) (forall ((v_subst_4 Int)) (let ((.cse16 (select (select .cse18 .cse19) (+ 4 .cse20)))) (or (not (<= (+ 8 v_subst_4) (select .cse15 .cse16))) (<= (+ v_subst_4 1) 0) (= (select (select .cse17 .cse16) (+ 4 v_subst_4)) 0)))) (not (<= (+ 8 .cse20) (select .cse15 .cse19))) (not (<= 0 .cse20))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| |c_#StackHeapBarrier|)))) (not (<= v_ArrVal_4995 8))))) is different from false [2022-11-16 11:50:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407907997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:51,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 84 [2022-11-16 11:50:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512098074] [2022-11-16 11:50:51,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:51,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-16 11:50:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-16 11:50:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=9933, Unknown=96, NotChecked=200, Total=10506 [2022-11-16 11:50:51,910 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 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:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:05,829 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-11-16 11:51:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 11:51:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 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 75 [2022-11-16 11:51:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:05,831 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:51:05,831 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 11:51:05,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=555, Invalid=17443, Unknown=96, NotChecked=266, Total=18360 [2022-11-16 11:51:05,833 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:05,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1699 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1703 Invalid, 0 Unknown, 357 Unchecked, 2.4s Time] [2022-11-16 11:51:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 11:51:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-16 11:51:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2022-11-16 11:51:05,836 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 75 [2022-11-16 11:51:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:05,836 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2022-11-16 11:51:05,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 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:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2022-11-16 11:51:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:51:05,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:05,837 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, 1, 1, 1, 1, 1, 1, 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:05,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 11:51:06,043 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -61181527, now seen corresponding path program 1 times [2022-11-16 11:51:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888474941] [2022-11-16 11:51:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 11:51:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888474941] [2022-11-16 11:51:06,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888474941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:06,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721248886] [2022-11-16 11:51:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:06,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:06,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:06,234 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:06,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:51:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:51:06,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:06,740 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:51:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 11:51:06,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:51:06,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721248886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:06,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:51:06,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-16 11:51:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999832289] [2022-11-16 11:51:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:06,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:51:06,751 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:51:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:06,956 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-11-16 11:51:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:51:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-11-16 11:51:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:06,958 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:51:06,958 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:51:06,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:51:06,958 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:06,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 199 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:51:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:51:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2022-11-16 11:51:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-16 11:51:06,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2022-11-16 11:51:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:06,963 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-16 11:51:06,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:51:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-16 11:51:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:51:06,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:06,965 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, 1, 1, 1, 1, 1, 1, 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:06,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:07,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 11:51:07,173 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash -61181526, now seen corresponding path program 1 times [2022-11-16 11:51:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:07,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515000750] [2022-11-16 11:51:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 11:51:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:07,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515000750] [2022-11-16 11:51:07,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515000750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:07,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999093765] [2022-11-16 11:51:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:07,479 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:07,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-16 11:51:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:51:07,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:08,065 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 23 treesize of output 15 [2022-11-16 11:51:08,069 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 26 treesize of output 14 [2022-11-16 11:51:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 11:51:08,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:08,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:08,400 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 34 treesize of output 38 [2022-11-16 11:51:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 11:51:08,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999093765] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:08,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:08,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2022-11-16 11:51:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739158191] [2022-11-16 11:51:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:08,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:51:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:51:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:51:08,549 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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:51:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:09,079 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-11-16 11:51:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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 77 [2022-11-16 11:51:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:09,080 INFO L225 Difference]: With dead ends: 86 [2022-11-16 11:51:09,080 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 11:51:09,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:51:09,081 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:09,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:51:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 11:51:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-11-16 11:51:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.082191780821918) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-11-16 11:51:09,085 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 77 [2022-11-16 11:51:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:09,085 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-11-16 11:51:09,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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:51:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-11-16 11:51:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-16 11:51:09,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:09,086 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, 1, 1, 1, 1, 1, 1, 1, 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:09,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:09,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:09,286 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1896628737, now seen corresponding path program 1 times [2022-11-16 11:51:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:09,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482891318] [2022-11-16 11:51:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:51:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482891318] [2022-11-16 11:51:10,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482891318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526512324] [2022-11-16 11:51:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:10,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:10,723 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:10,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-16 11:51:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:11,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:51:11,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:11,197 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:51:11,309 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5499 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5499))))) is different from true [2022-11-16 11:51:11,347 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:51:11,391 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5500 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5500))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-16 11:51:11,434 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:51:11,487 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5501 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5501))))) is different from true [2022-11-16 11:51:11,526 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:51:11,731 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:51:11,731 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:51:11,869 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 16 treesize of output 8 [2022-11-16 11:51:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 18 not checked. [2022-11-16 11:51:11,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:12,047 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:51:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 11:51:13,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526512324] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:13,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:13,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [23, 12] total 36 [2022-11-16 11:51:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645859194] [2022-11-16 11:51:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:13,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:51:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:51:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=957, Unknown=3, NotChecked=192, Total=1260 [2022-11-16 11:51:13,153 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 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:51:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:13,508 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-11-16 11:51:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:51:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 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 78 [2022-11-16 11:51:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:13,509 INFO L225 Difference]: With dead ends: 83 [2022-11-16 11:51:13,509 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 11:51:13,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=153, Invalid=1262, Unknown=3, NotChecked=222, Total=1640 [2022-11-16 11:51:13,510 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:13,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 145 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:51:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 11:51:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-16 11:51:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-11-16 11:51:13,514 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-11-16 11:51:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:13,514 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-11-16 11:51:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 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:51:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-11-16 11:51:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 11:51:13,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:13,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:13,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 11:51:13,727 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1334098057, now seen corresponding path program 1 times [2022-11-16 11:51:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:13,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661569420] [2022-11-16 11:51:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:51:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:14,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661569420] [2022-11-16 11:51:14,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661569420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:14,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291888617] [2022-11-16 11:51:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:14,823 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:14,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-16 11:51:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:15,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 11:51:15,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:15,742 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:15,747 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:15,875 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5678 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5678))) (exists ((v_ArrVal_5677 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5677)))) is different from true [2022-11-16 11:51:15,887 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5679))) (exists ((v_ArrVal_5680 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_5680))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 11:51:15,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:15,916 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:15,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:15,922 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 15 treesize of output 17 [2022-11-16 11:51:16,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:16,043 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 18 treesize of output 22 [2022-11-16 11:51:16,199 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:51:16,199 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 21 treesize of output 20 [2022-11-16 11:51:16,255 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:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2022-11-16 11:51:16,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:16,752 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_112| Int)) (or (not (< |v_node_create_~temp~0#1.base_112| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5689 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_112| v_ArrVal_5689) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) (forall ((|v_node_create_~temp~0#1.base_112| Int)) (or (forall ((v_ArrVal_5690 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_112| v_ArrVal_5690) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_5689 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_112| v_ArrVal_5689) |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0))) (not (< |v_node_create_~temp~0#1.base_112| |c_#StackHeapBarrier|))))) is different from false [2022-11-16 11:51:16,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291888617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:16,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:16,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2022-11-16 11:51:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777721008] [2022-11-16 11:51:16,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:16,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 11:51:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 11:51:16,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1150, Unknown=3, NotChecked=210, Total=1482 [2022-11-16 11:51:16,757 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 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:51:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:18,007 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-11-16 11:51:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:51:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 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 79 [2022-11-16 11:51:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:18,008 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:51:18,008 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:51:18,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=255, Invalid=2201, Unknown=6, NotChecked=294, Total=2756 [2022-11-16 11:51:18,009 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 194 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:18,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 378 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 411 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2022-11-16 11:51:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:51:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-16 11:51:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-11-16 11:51:18,013 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2022-11-16 11:51:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:18,014 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-11-16 11:51:18,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 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:51:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-11-16 11:51:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 11:51:18,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:18,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:18,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 11:51:18,245 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1592633024, now seen corresponding path program 1 times [2022-11-16 11:51:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922618650] [2022-11-16 11:51:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:51:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922618650] [2022-11-16 11:51:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922618650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924011922] [2022-11-16 11:51:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:19,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:19,811 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:19,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-16 11:51:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:20,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:51:20,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:20,885 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 16 treesize of output 8 [2022-11-16 11:51:21,014 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5857 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5857)))) is different from true [2022-11-16 11:51:21,022 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5858 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5858) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 11:51:21,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:21,045 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 22 [2022-11-16 11:51:21,341 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:51:21,341 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 38 treesize of output 38 [2022-11-16 11:51:21,560 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 23 treesize of output 11 [2022-11-16 11:51:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2022-11-16 11:51:21,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:26,918 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864))) (or (<= (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (not (= (select (select .cse0 |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0)))))))))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864))) (or (<= (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int)) (not (= (select (select .cse1 |ULTIMATE.start_sll_append_~last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (not (= (select .cse2 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0))))))))) is different from false [2022-11-16 11:51:26,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924011922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:26,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:26,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2022-11-16 11:51:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850952746] [2022-11-16 11:51:26,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 11:51:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:51:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1353, Unknown=3, NotChecked=228, Total=1722 [2022-11-16 11:51:26,924 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 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:51:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:31,890 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-11-16 11:51:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:51:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 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 80 [2022-11-16 11:51:31,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:31,892 INFO L225 Difference]: With dead ends: 87 [2022-11-16 11:51:31,892 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 11:51:31,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=346, Invalid=2740, Unknown=6, NotChecked=330, Total=3422 [2022-11-16 11:51:31,893 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 311 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:31,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 569 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 676 Invalid, 0 Unknown, 133 Unchecked, 0.9s Time] [2022-11-16 11:51:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 11:51:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-16 11:51:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-11-16 11:51:31,897 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2022-11-16 11:51:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:31,898 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-11-16 11:51:31,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 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:51:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-11-16 11:51:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 11:51:31,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:31,899 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:31,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:32,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:32,108 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 373470414, now seen corresponding path program 1 times [2022-11-16 11:51:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:32,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125333715] [2022-11-16 11:51:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:36,640 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:51:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:36,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125333715] [2022-11-16 11:51:36,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125333715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:36,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942169501] [2022-11-16 11:51:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:36,642 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:36,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-16 11:51:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:37,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 11:51:37,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:37,763 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:38,135 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:38,135 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:38,436 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:51:39,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:39,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:39,260 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 51 treesize of output 18 [2022-11-16 11:51:39,265 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:39,663 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_6038 (Array Int Int)) (v_ArrVal_6037 (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_6038) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_6037)))) is different from true [2022-11-16 11:51:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:39,742 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:51:39,743 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:51:39,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:39,752 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 62 treesize of output 58 [2022-11-16 11:51:39,766 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:51:39,766 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:51:40,076 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 63 treesize of output 43 [2022-11-16 11:51:41,197 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:51:41,197 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 65 treesize of output 56 [2022-11-16 11:51:42,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:42,659 INFO L321 Elim1Store]: treesize reduction 4, result has 85.2 percent of original size [2022-11-16 11:51:42,659 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 65 treesize of output 46 [2022-11-16 11:51:43,341 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:51:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2022-11-16 11:51:43,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:44,694 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse0 |c_#StackHeapBarrier|)) (not (= (select (select .cse1 .cse0) 4) .cse0)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= (select |c_#valid| (select (select .cse3 .cse2) 4)) 1)))))) is different from false [2022-11-16 11:51:44,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:44,736 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 76 treesize of output 80 [2022-11-16 11:51:44,795 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_89))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse0 |c_#StackHeapBarrier|)) (not (= (select (select .cse1 .cse0) 4) .cse0)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= (select (select .cse3 .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|)))))) is different from false [2022-11-16 11:51:44,820 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_89))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) .cse1)) (not (< .cse1 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select .cse3 .cse2) 4))))))) is different from false [2022-11-16 11:51:44,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_89))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) 4))) (not (< .cse0 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6039))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse3 |c_#StackHeapBarrier|)) (= (select (select .cse4 .cse3) 4) .cse2))))))) is different from false [2022-11-16 11:51:45,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_89))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) .cse1)) (not (< .cse1 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6039))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 (select (select .cse3 .cse4) 4)) (not (< .cse4 |c_#StackHeapBarrier|)))))))) is different from false [2022-11-16 11:51:45,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942169501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:45,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:45,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 36] total 69 [2022-11-16 11:51:45,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802771634] [2022-11-16 11:51:45,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:45,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:51:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:51:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=5585, Unknown=26, NotChecked=930, Total=6806 [2022-11-16 11:51:45,915 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 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:51:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:51,509 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-11-16 11:51:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 11:51:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 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 83 [2022-11-16 11:51:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:51,511 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:51:51,511 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:51:51,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=540, Invalid=9558, Unknown=26, NotChecked=1218, Total=11342 [2022-11-16 11:51:51,513 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:51,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 955 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1363 Invalid, 0 Unknown, 102 Unchecked, 1.7s Time] [2022-11-16 11:51:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:51:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-11-16 11:51:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 83 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:51:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-11-16 11:51:51,517 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 83 [2022-11-16 11:51:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:51,518 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-11-16 11:51:51,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 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:51:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-11-16 11:51:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 11:51:51,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:51,519 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:51,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:51,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-16 11:51:51,727 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-16 11:51:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 373470415, now seen corresponding path program 1 times [2022-11-16 11:51:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158041809] [2022-11-16 11:51:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:51:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:51:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:51:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:51:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:53,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158041809] [2022-11-16 11:51:53,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158041809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:53,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434267798] [2022-11-16 11:51:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:53,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:53,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:53,086 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:53,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_075c7933-efb7-40f1-86fc-e1cc481846ea/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-16 11:51:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-16 11:51:53,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:53,653 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,574 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 36 treesize of output 20 [2022-11-16 11:51:54,586 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:54,915 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_6222 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_6222))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6218 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_6218) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_6221 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_6221))))) is different from true [2022-11-16 11:51:54,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:54,988 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 25 treesize of output 21 [2022-11-16 11:51:54,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:55,000 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:55,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:55,010 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 42 treesize of output 38 [2022-11-16 11:51:55,036 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:51:55,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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 11:51:56,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:56,439 INFO L321 Elim1Store]: treesize reduction 72, result has 38.5 percent of original size [2022-11-16 11:51:56,439 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 145 [2022-11-16 11:51:56,496 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-16 11:51:56,496 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 201 treesize of output 118 [2022-11-16 11:51:59,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:59,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 429 treesize of output 606 [2022-11-16 11:52:00,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:00,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 537 treesize of output 606