./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:53:20,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:53:20,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:53:20,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:53:20,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:53:20,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:53:20,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:53:20,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:53:20,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:53:20,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:53:20,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:53:20,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:53:20,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:53:20,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:53:20,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:53:20,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:53:20,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:53:20,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:53:20,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:53:20,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:53:20,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:53:20,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:53:20,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:53:20,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:53:20,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:53:20,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:53:20,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:53:20,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:53:20,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:53:20,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:53:20,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:53:20,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:53:20,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:53:20,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:53:20,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:53:20,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:53:20,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:53:20,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:53:20,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:53:20,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:53:20,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:53:20,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 17:53:20,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:53:20,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:53:20,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:53:20,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:53:20,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:53:20,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:53:20,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:53:20,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:53:20,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:53:20,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:53:20,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:53:20,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:53:20,267 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:53:20,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:53:20,268 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:53:20,268 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/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_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-12-13 17:53:20,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:53:20,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:53:20,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:53:20,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:53:20,471 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:53:20,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-12-13 17:53:22,993 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:53:23,177 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:53:23,178 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-12-13 17:53:23,186 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/data/373461e65/d9c7d161152742b48623550cadb24c31/FLAG456a77704 [2022-12-13 17:53:23,567 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/data/373461e65/d9c7d161152742b48623550cadb24c31 [2022-12-13 17:53:23,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:53:23,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:53:23,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:53:23,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:53:23,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:53:23,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2535ad79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23, skipping insertion in model container [2022-12-13 17:53:23,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:53:23,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:53:23,807 WARN L237 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_8b36e3ef-02cd-48f0-9868-128decdbdcbb/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-12-13 17:53:23,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:53:23,815 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:53:23,846 WARN L237 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_8b36e3ef-02cd-48f0-9868-128decdbdcbb/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-12-13 17:53:23,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:53:23,864 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:53:23,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23 WrapperNode [2022-12-13 17:53:23,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:53:23,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:53:23,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:53:23,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:53:23,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,896 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-12-13 17:53:23,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:53:23,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:53:23,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:53:23,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:53:23,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,915 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:53:23,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:53:23,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:53:23,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:53:23,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (1/1) ... [2022-12-13 17:53:23,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:53:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:23,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:53:23,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:53:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:53:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:53:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 17:53:23,980 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 17:53:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:53:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:53:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:53:24,085 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:53:24,087 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:53:24,382 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:53:24,388 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:53:24,388 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 17:53:24,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:53:24 BoogieIcfgContainer [2022-12-13 17:53:24,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:53:24,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:53:24,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:53:24,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:53:24,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:53:23" (1/3) ... [2022-12-13 17:53:24,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f34fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:53:24, skipping insertion in model container [2022-12-13 17:53:24,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:53:23" (2/3) ... [2022-12-13 17:53:24,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f34fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:53:24, skipping insertion in model container [2022-12-13 17:53:24,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:53:24" (3/3) ... [2022-12-13 17:53:24,397 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-12-13 17:53:24,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:53:24,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-12-13 17:53:24,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:53:24,450 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e2ae47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:53:24,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-12-13 17:53:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:53:24,458 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:24,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:24,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-12-13 17:53:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:24,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106010268] [2022-12-13 17:53:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106010268] [2022-12-13 17:53:24,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106010268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:24,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:53:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976871316] [2022-12-13 17:53:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:24,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:53:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:53:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:53:24,723 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:53:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:24,824 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-12-13 17:53:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:53:24,826 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-12-13 17:53:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:24,832 INFO L225 Difference]: With dead ends: 105 [2022-12-13 17:53:24,832 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 17:53:24,834 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-12-13 17:53:24,837 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:24,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 17:53:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-13 17:53:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-12-13 17:53:24,869 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-12-13 17:53:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-12-13 17:53:24,869 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-12-13 17:53:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-12-13 17:53:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:53:24,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:24,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:24,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:53:24,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-12-13 17:53:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:24,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156217785] [2022-12-13 17:53:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:24,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156217785] [2022-12-13 17:53:24,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156217785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:24,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:24,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:53:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874018013] [2022-12-13 17:53:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:24,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:53:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:24,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:53:24,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:53:24,979 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:53:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:25,050 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-12-13 17:53:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:53:25,050 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-12-13 17:53:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:25,051 INFO L225 Difference]: With dead ends: 99 [2022-12-13 17:53:25,051 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 17:53:25,051 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-12-13 17:53:25,052 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:25,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 17:53:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-12-13 17:53:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-12-13 17:53:25,058 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-12-13 17:53:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:25,058 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-12-13 17:53:25,058 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-12-13 17:53:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-12-13 17:53:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:53:25,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:25,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:25,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:53:25,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-12-13 17:53:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:25,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873070655] [2022-12-13 17:53:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873070655] [2022-12-13 17:53:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873070655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:25,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:53:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939123052] [2022-12-13 17:53:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:53:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:53:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:53:25,270 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:25,474 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-12-13 17:53:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:53:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-13 17:53:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:25,476 INFO L225 Difference]: With dead ends: 102 [2022-12-13 17:53:25,476 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 17:53:25,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:53:25,478 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 18 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:25,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 476 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:53:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 17:53:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-12-13 17:53:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-12-13 17:53:25,488 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-12-13 17:53:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:25,488 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-12-13 17:53:25,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-12-13 17:53:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:53:25,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:25,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:25,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:53:25,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-12-13 17:53:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364246040] [2022-12-13 17:53:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:25,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364246040] [2022-12-13 17:53:25,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364246040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:25,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:25,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:53:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472221677] [2022-12-13 17:53:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:25,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:53:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:53:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:53:25,602 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:25,778 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-12-13 17:53:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:53:25,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-13 17:53:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:25,779 INFO L225 Difference]: With dead ends: 100 [2022-12-13 17:53:25,779 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 17:53:25,779 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-12-13 17:53:25,780 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:25,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:53:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 17:53:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-12-13 17:53:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-12-13 17:53:25,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-12-13 17:53:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:25,784 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-12-13 17:53:25,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-12-13 17:53:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:53:25,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:25,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:25,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:53:25,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-12-13 17:53:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:25,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460457181] [2022-12-13 17:53:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 17:53:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460457181] [2022-12-13 17:53:25,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460457181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:25,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:53:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437076222] [2022-12-13 17:53:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:25,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:53:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:53:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:53:25,841 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:25,914 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-12-13 17:53:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:53:25,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:53:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:25,916 INFO L225 Difference]: With dead ends: 105 [2022-12-13 17:53:25,916 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 17:53:25,916 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-12-13 17:53:25,917 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:25,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 17:53:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-12-13 17:53:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-12-13 17:53:25,924 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-12-13 17:53:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:25,924 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-12-13 17:53:25,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-12-13 17:53:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 17:53:25,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:25,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:25,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:53:25,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-12-13 17:53:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:25,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672835409] [2022-12-13 17:53:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:25,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672835409] [2022-12-13 17:53:25,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672835409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:25,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:25,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:53:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953498946] [2022-12-13 17:53:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:53:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:53:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:53:25,997 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:26,070 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-12-13 17:53:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:53:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-13 17:53:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:26,071 INFO L225 Difference]: With dead ends: 102 [2022-12-13 17:53:26,071 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 17:53:26,072 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-12-13 17:53:26,072 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:26,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 17:53:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-12-13 17:53:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-12-13 17:53:26,078 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-12-13 17:53:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:26,078 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-12-13 17:53:26,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:53:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-12-13 17:53:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 17:53:26,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:26,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:53:26,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-12-13 17:53:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438966922] [2022-12-13 17:53:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:53:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:53:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438966922] [2022-12-13 17:53:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438966922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:26,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477789394] [2022-12-13 17:53:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:26,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:26,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:53:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:53:26,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:53:26,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:53:26,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477789394] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:53:26,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:53:26,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 17:53:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459539470] [2022-12-13 17:53:26,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:53:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:53:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:53:26,387 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:53:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:26,474 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-12-13 17:53:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:53:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-12-13 17:53:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:26,475 INFO L225 Difference]: With dead ends: 103 [2022-12-13 17:53:26,475 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 17:53:26,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:53:26,476 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:26,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 428 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 17:53:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-13 17:53:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-12-13 17:53:26,483 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-12-13 17:53:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:26,483 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-12-13 17:53:26,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:53:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-12-13 17:53:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:53:26,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:26,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:26,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:53:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 17:53:26,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-12-13 17:53:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032320024] [2022-12-13 17:53:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:53:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032320024] [2022-12-13 17:53:26,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032320024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825821115] [2022-12-13 17:53:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:26,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:26,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:26,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:53:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:27,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 17:53:27,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:27,111 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-12-13 17:53:27,152 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:53:27,210 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:53:27,210 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-12-13 17:53:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 17:53:27,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:27,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825821115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:27,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:27,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-12-13 17:53:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962889704] [2022-12-13 17:53:27,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 17:53:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 17:53:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-12-13 17:53:27,265 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:53:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:27,536 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-12-13 17:53:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:53:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-12-13 17:53:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:27,537 INFO L225 Difference]: With dead ends: 114 [2022-12-13 17:53:27,538 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 17:53:27,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-12-13 17:53:27,539 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 168 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:27,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 329 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2022-12-13 17:53:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 17:53:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-12-13 17:53:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-12-13 17:53:27,543 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-12-13 17:53:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:27,543 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-12-13 17:53:27,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:53:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-12-13 17:53:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:53:27,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:27,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:27,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:53:27,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:27,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-12-13 17:53:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:27,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930291855] [2022-12-13 17:53:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:53:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930291855] [2022-12-13 17:53:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930291855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122871075] [2022-12-13 17:53:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:28,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:28,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:28,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:28,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:53:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:28,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:53:28,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:28,209 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-12-13 17:53:28,214 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-12-13 17:53:28,327 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:53:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:28,372 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-12-13 17:53:28,380 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:53:28,380 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-12-13 17:53:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 17:53:28,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:30,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122871075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:30,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:30,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2022-12-13 17:53:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074611905] [2022-12-13 17:53:30,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:30,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 17:53:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 17:53:30,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2022-12-13 17:53:30,510 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:53:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:30,883 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-12-13 17:53:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:53:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-12-13 17:53:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:30,884 INFO L225 Difference]: With dead ends: 102 [2022-12-13 17:53:30,884 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 17:53:30,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2022-12-13 17:53:30,886 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:30,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-12-13 17:53:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 17:53:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-12-13 17:53:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-12-13 17:53:30,890 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-12-13 17:53:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-12-13 17:53:30,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:53:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-12-13 17:53:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 17:53:30,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:30,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:30,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:53:31,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:31,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-12-13 17:53:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:31,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714509513] [2022-12-13 17:53:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:53:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:53:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714509513] [2022-12-13 17:53:31,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714509513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619980103] [2022-12-13 17:53:31,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:53:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:31,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:31,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:53:31,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:53:31,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:53:31,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:53:31,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:53:31,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:53:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619980103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:53:31,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:53:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-12-13 17:53:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511117313] [2022-12-13 17:53:31,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:31,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:53:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:53:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:53:31,646 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:53:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:31,788 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-12-13 17:53:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:53:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-12-13 17:53:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:31,790 INFO L225 Difference]: With dead ends: 101 [2022-12-13 17:53:31,790 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 17:53:31,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:53:31,791 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:31,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 411 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 17:53:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-13 17:53:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-12-13 17:53:31,795 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-12-13 17:53:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:31,795 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-12-13 17:53:31,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:53:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-12-13 17:53:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 17:53:31,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:31,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:31,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:53:31,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 17:53:31,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-12-13 17:53:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:31,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442026489] [2022-12-13 17:53:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:53:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442026489] [2022-12-13 17:53:32,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442026489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328479443] [2022-12-13 17:53:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:32,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:32,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:32,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:53:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:32,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 17:53:32,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:32,484 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-12-13 17:53:32,496 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-12-13 17:53:32,510 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1169 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1169))))) is different from true [2022-12-13 17:53:32,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:32,548 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-12-13 17:53:32,563 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-12-13 17:53:32,581 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:53:32,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:53:32,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:53:32,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:53:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 14 not checked. [2022-12-13 17:53:32,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:32,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328479443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:32,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:32,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2022-12-13 17:53:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434996318] [2022-12-13 17:53:32,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:32,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:53:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:53:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2022-12-13 17:53:32,862 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:53:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:33,142 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2022-12-13 17:53:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:53:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-12-13 17:53:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:33,143 INFO L225 Difference]: With dead ends: 108 [2022-12-13 17:53:33,144 INFO L226 Difference]: Without dead ends: 108 [2022-12-13 17:53:33,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2022-12-13 17:53:33,144 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:33,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 294 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 345 Invalid, 0 Unknown, 206 Unchecked, 0.2s Time] [2022-12-13 17:53:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-13 17:53:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2022-12-13 17:53:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-12-13 17:53:33,148 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2022-12-13 17:53:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:33,149 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-12-13 17:53:33,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:53:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-12-13 17:53:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 17:53:33,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:33,150 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:33,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:53:33,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 17:53:33,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2022-12-13 17:53:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:33,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567489298] [2022-12-13 17:53:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 17:53:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:33,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567489298] [2022-12-13 17:53:33,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567489298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:33,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213993494] [2022-12-13 17:53:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:33,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:33,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:33,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:33,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:53:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:34,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 17:53:34,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:34,124 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-12-13 17:53:34,137 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-12-13 17:53:34,152 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1422 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1422) |c_#length|)))) is different from true [2022-12-13 17:53:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:34,185 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-12-13 17:53:34,216 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-12-13 17:53:34,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1423 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1423))))) is different from true [2022-12-13 17:53:34,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:34,269 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-12-13 17:53:34,312 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-12-13 17:53:34,318 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1424 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1424))))) is different from true [2022-12-13 17:53:34,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:34,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-12-13 17:53:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-12-13 17:53:34,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:34,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213993494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:34,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-12-13 17:53:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94526430] [2022-12-13 17:53:34,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 17:53:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 17:53:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-12-13 17:53:34,428 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:53:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:34,686 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-12-13 17:53:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:53:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-12-13 17:53:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:34,688 INFO L225 Difference]: With dead ends: 103 [2022-12-13 17:53:34,688 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 17:53:34,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-12-13 17:53:34,688 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 243 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:34,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 193 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2022-12-13 17:53:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 17:53:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-12-13 17:53:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 86 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-12-13 17:53:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-12-13 17:53:34,692 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 47 [2022-12-13 17:53:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:34,692 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-12-13 17:53:34,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:53:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-12-13 17:53:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 17:53:34,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:34,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:34,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:53:34,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:34,894 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2022-12-13 17:53:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:34,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176052469] [2022-12-13 17:53:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:53:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176052469] [2022-12-13 17:53:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176052469] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553184382] [2022-12-13 17:53:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:35,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:35,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:35,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:35,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:53:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:35,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 17:53:35,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:35,699 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-12-13 17:53:35,840 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-12-13 17:53:35,950 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1676 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1676) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 17:53:35,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:35,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 17:53:35,981 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 17:53:35,981 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-12-13 17:53:36,046 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-12-13 17:53:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 17:53:36,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:36,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_1682) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1))) is different from false [2022-12-13 17:53:36,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553184382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:36,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:36,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-12-13 17:53:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96638383] [2022-12-13 17:53:36,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:36,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 17:53:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 17:53:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2022-12-13 17:53:36,108 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:37,118 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2022-12-13 17:53:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:53:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-12-13 17:53:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:37,120 INFO L225 Difference]: With dead ends: 143 [2022-12-13 17:53:37,120 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 17:53:37,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1190, Unknown=5, NotChecked=146, Total=1560 [2022-12-13 17:53:37,121 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 400 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:37,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 948 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1197 Invalid, 3 Unknown, 152 Unchecked, 0.7s Time] [2022-12-13 17:53:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 17:53:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 90. [2022-12-13 17:53:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.492063492063492) internal successors, (94), 85 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-12-13 17:53:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-12-13 17:53:37,124 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 51 [2022-12-13 17:53:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-12-13 17:53:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-12-13 17:53:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 17:53:37,125 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:37,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:37,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 17:53:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:37,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2022-12-13 17:53:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:37,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028925676] [2022-12-13 17:53:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:53:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028925676] [2022-12-13 17:53:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028925676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596212732] [2022-12-13 17:53:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:38,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:38,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:38,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:38,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:53:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:38,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 17:53:38,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:38,627 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-12-13 17:53:38,946 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-12-13 17:53:38,949 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-12-13 17:53:39,109 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1934 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1934))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1933 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1933) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1928 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1928) |c_#length|)))) is different from true [2022-12-13 17:53:39,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:39,144 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-12-13 17:53:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:39,149 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-12-13 17:53:39,157 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 17:53:39,157 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-12-13 17:53:39,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 17:53:39,205 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-12-13 17:53:39,207 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-12-13 17:53:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 17:53:39,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:40,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596212732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:40,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:40,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-12-13 17:53:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969573973] [2022-12-13 17:53:40,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:40,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 17:53:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 17:53:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2022-12-13 17:53:40,222 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:42,109 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2022-12-13 17:53:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:53:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-12-13 17:53:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:42,110 INFO L225 Difference]: With dead ends: 139 [2022-12-13 17:53:42,110 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 17:53:42,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=275, Invalid=2376, Unknown=5, NotChecked=100, Total=2756 [2022-12-13 17:53:42,111 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 588 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:42,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1285 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1548 Invalid, 3 Unknown, 138 Unchecked, 1.1s Time] [2022-12-13 17:53:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 17:53:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 93. [2022-12-13 17:53:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-12-13 17:53:42,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2022-12-13 17:53:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:42,115 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-12-13 17:53:42,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-12-13 17:53:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 17:53:42,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:42,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:42,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 17:53:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 17:53:42,318 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2022-12-13 17:53:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:42,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588809754] [2022-12-13 17:53:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:53:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:42,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588809754] [2022-12-13 17:53:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588809754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:42,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:42,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:53:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855030361] [2022-12-13 17:53:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:42,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:53:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:53:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:53:42,554 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:42,737 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-12-13 17:53:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:53:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-12-13 17:53:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:42,738 INFO L225 Difference]: With dead ends: 141 [2022-12-13 17:53:42,738 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 17:53:42,738 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-12-13 17:53:42,739 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 222 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:42,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 346 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:53:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 17:53:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-12-13 17:53:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.408450704225352) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-12-13 17:53:42,742 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2022-12-13 17:53:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:42,742 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-12-13 17:53:42,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-12-13 17:53:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 17:53:42,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:42,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:42,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:53:42,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2022-12-13 17:53:42,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:42,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81879560] [2022-12-13 17:53:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:53:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81879560] [2022-12-13 17:53:43,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81879560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:53:43,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:53:43,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:53:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377778401] [2022-12-13 17:53:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:53:43,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:53:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:53:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:53:43,080 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:43,331 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-12-13 17:53:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:53:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-12-13 17:53:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:43,332 INFO L225 Difference]: With dead ends: 151 [2022-12-13 17:53:43,332 INFO L226 Difference]: Without dead ends: 151 [2022-12-13 17:53:43,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:53:43,333 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 282 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:43,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 376 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:53:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-13 17:53:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2022-12-13 17:53:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-12-13 17:53:43,335 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-12-13 17:53:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:43,335 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-12-13 17:53:43,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:53:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-12-13 17:53:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:53:43,335 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:43,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:53:43,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2022-12-13 17:53:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052080800] [2022-12-13 17:53:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:53:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052080800] [2022-12-13 17:53:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052080800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173300323] [2022-12-13 17:53:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:44,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:44,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:53:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:44,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-13 17:53:44,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:44,975 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-12-13 17:53:45,204 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:53:45,204 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-12-13 17:53:45,311 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-12-13 17:53:45,375 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:53:45,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-13 17:53:45,599 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 17:53:45,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2022-12-13 17:53:45,603 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-12-13 17:53:45,607 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-12-13 17:53:45,766 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2518 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2519) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2518) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 17:53:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:45,805 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:53:45,805 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-12-13 17:53:45,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:45,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-12-13 17:53:45,839 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-12-13 17:53:45,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 17:53:45,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-12-13 17:53:46,064 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-12-13 17:53:46,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-12-13 17:53:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 17:53:46,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:46,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173300323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:46,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:46,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-12-13 17:53:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893370376] [2022-12-13 17:53:46,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:46,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 17:53:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 17:53:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2366, Unknown=1, NotChecked=98, Total=2652 [2022-12-13 17:53:46,429 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:53:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:49,117 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-12-13 17:53:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 17:53:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-12-13 17:53:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:49,119 INFO L225 Difference]: With dead ends: 152 [2022-12-13 17:53:49,119 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 17:53:49,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=503, Invalid=4192, Unknown=1, NotChecked=134, Total=4830 [2022-12-13 17:53:49,120 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 752 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:49,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1780 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2131 Invalid, 0 Unknown, 131 Unchecked, 1.4s Time] [2022-12-13 17:53:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 17:53:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 102. [2022-12-13 17:53:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3875) internal successors, (111), 97 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-12-13 17:53:49,123 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2022-12-13 17:53:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:49,123 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-12-13 17:53:49,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:53:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-12-13 17:53:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:53:49,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:49,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:49,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 17:53:49,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 17:53:49,325 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2022-12-13 17:53:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:49,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459568495] [2022-12-13 17:53:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:50,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:53:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459568495] [2022-12-13 17:53:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459568495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:51,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439396431] [2022-12-13 17:53:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:51,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:51,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:53:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:51,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-13 17:53:51,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:51,539 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-12-13 17:53:51,826 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:53:51,826 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-12-13 17:53:51,936 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-12-13 17:53:51,946 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-12-13 17:53:52,045 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:53:52,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-12-13 17:53:52,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-12-13 17:53:52,306 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 17:53:52,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 48 [2022-12-13 17:53:52,318 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-13 17:53:52,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-12-13 17:53:52,324 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-12-13 17:53:52,328 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-12-13 17:53:52,539 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2790 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2790) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2791 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2791))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2785 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2785))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:53:52,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:52,580 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:53:52,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 97 [2022-12-13 17:53:52,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:52,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:52,589 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 17:53:52,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-12-13 17:53:52,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:52,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-12-13 17:53:52,611 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 17:53:52,611 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-12-13 17:53:52,927 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 17:53:52,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-12-13 17:53:52,935 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-13 17:53:52,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-12-13 17:53:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 17:53:52,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:53,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439396431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:53,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:53,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-12-13 17:53:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548261962] [2022-12-13 17:53:53,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:53,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 17:53:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 17:53:53,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3014, Unknown=2, NotChecked=110, Total=3306 [2022-12-13 17:53:53,394 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:53:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:58,260 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2022-12-13 17:53:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 17:53:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-12-13 17:53:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:58,261 INFO L225 Difference]: With dead ends: 208 [2022-12-13 17:53:58,261 INFO L226 Difference]: Without dead ends: 208 [2022-12-13 17:53:58,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=564, Invalid=5600, Unknown=2, NotChecked=154, Total=6320 [2022-12-13 17:53:58,263 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1004 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:58,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1846 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3256 Invalid, 0 Unknown, 188 Unchecked, 2.3s Time] [2022-12-13 17:53:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-13 17:53:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2022-12-13 17:53:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 99 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-12-13 17:53:58,265 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2022-12-13 17:53:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-12-13 17:53:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:53:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-12-13 17:53:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 17:53:58,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:58,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:58,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 17:53:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 17:53:58,467 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:53:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2022-12-13 17:53:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:58,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7214101] [2022-12-13 17:53:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:53:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:53:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:53:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:53:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:58,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7214101] [2022-12-13 17:53:58,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7214101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:58,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203771479] [2022-12-13 17:53:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:58,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:58,895 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:58,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 17:53:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:59,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 17:53:59,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:59,267 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-12-13 17:53:59,324 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3063 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-12-13 17:53:59,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:59,338 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-12-13 17:53:59,361 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-12-13 17:53:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 17:53:59,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203771479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:59,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:59,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-12-13 17:53:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950085938] [2022-12-13 17:53:59,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:59,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 17:53:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 17:53:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=617, Unknown=2, NotChecked=50, Total=756 [2022-12-13 17:53:59,464 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:59,885 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-12-13 17:53:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:53:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-12-13 17:53:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:59,886 INFO L225 Difference]: With dead ends: 92 [2022-12-13 17:53:59,886 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 17:53:59,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1016, Unknown=2, NotChecked=66, Total=1260 [2022-12-13 17:53:59,887 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 283 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:59,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 574 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 464 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2022-12-13 17:53:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 17:53:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-12-13 17:53:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:53:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-12-13 17:53:59,889 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2022-12-13 17:53:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:59,889 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-12-13 17:53:59,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:53:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-12-13 17:53:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 17:53:59,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:59,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:53:59,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 17:54:00,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:00,091 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:54:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2022-12-13 17:54:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:00,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608253798] [2022-12-13 17:54:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:54:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:54:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:54:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:54:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608253798] [2022-12-13 17:54:00,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608253798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:54:00,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:54:00,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 17:54:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843893162] [2022-12-13 17:54:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:54:00,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 17:54:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 17:54:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:54:00,621 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:54:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:01,265 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-12-13 17:54:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:54:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-12-13 17:54:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:54:01,266 INFO L225 Difference]: With dead ends: 157 [2022-12-13 17:54:01,266 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 17:54:01,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 17:54:01,266 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 927 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:54:01,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 479 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:54:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 17:54:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2022-12-13 17:54:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:54:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-12-13 17:54:01,268 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2022-12-13 17:54:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:54:01,269 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-12-13 17:54:01,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:54:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-12-13 17:54:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 17:54:01,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:54:01,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:54:01,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:54:01,269 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:54:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2022-12-13 17:54:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568556945] [2022-12-13 17:54:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:54:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:54:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:01,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:54:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:54:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:02,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568556945] [2022-12-13 17:54:02,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568556945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:02,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114857438] [2022-12-13 17:54:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:02,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:02,294 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:02,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 17:54:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:02,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 17:54:02,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:02,468 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-12-13 17:54:02,500 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-12-13 17:54:02,570 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:54:02,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:54:02,680 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-12-13 17:54:02,743 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:54:02,743 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-12-13 17:54:02,971 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-12-13 17:54:02,974 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-12-13 17:54:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:03,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2022-12-13 17:54:03,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:03,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 17:54:03,439 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:54:03,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:54:03,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-12-13 17:54:03,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:03,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-13 17:54:03,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:03,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 17:54:03,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 31 treesize of output 19 [2022-12-13 17:54:03,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 17:54:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:54:03,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:03,750 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3512 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3511 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:54:03,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:54:03,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-12-13 17:54:03,977 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3510) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:54:03,993 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3509) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_prenex_7) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3510) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-12-13 17:54:04,009 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_7) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3509) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3510) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-12-13 17:54:04,261 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3522 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3522))) (< (select (select (store (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_prenex_7) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1)))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= (select (select (store (store .cse1 .cse2 v_ArrVal_3509) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3511) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2)))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3522) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3521) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_3510) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3512) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-12-13 17:54:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114857438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:04,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:54:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2022-12-13 17:54:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499683460] [2022-12-13 17:54:04,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:04,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 17:54:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 17:54:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2285, Unknown=29, NotChecked=500, Total=2970 [2022-12-13 17:54:04,265 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:54:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:06,192 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2022-12-13 17:54:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 17:54:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-12-13 17:54:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:54:06,193 INFO L225 Difference]: With dead ends: 192 [2022-12-13 17:54:06,193 INFO L226 Difference]: Without dead ends: 192 [2022-12-13 17:54:06,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=536, Invalid=4285, Unknown=29, NotChecked=700, Total=5550 [2022-12-13 17:54:06,196 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1502 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:54:06,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 972 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:54:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-13 17:54:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 105. [2022-12-13 17:54:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:54:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-12-13 17:54:06,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2022-12-13 17:54:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:54:06,201 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-12-13 17:54:06,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:54:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-12-13 17:54:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:54:06,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:54:06,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:54:06,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 17:54:06,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:06,402 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:54:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2022-12-13 17:54:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:06,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359051971] [2022-12-13 17:54:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:54:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:08,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:54:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:54:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:54:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:09,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359051971] [2022-12-13 17:54:09,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359051971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:09,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748791243] [2022-12-13 17:54:09,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:54:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:09,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:09,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 17:54:09,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:54:09,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:54:09,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-13 17:54:09,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:09,606 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-12-13 17:54:09,779 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-12-13 17:54:09,783 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-12-13 17:54:10,171 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:54:10,172 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-12-13 17:54:10,182 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:54:10,182 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-12-13 17:54:10,186 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-12-13 17:54:10,319 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-12-13 17:54:10,325 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-12-13 17:54:10,395 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-12-13 17:54:10,402 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-12-13 17:54:10,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:10,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:10,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:54:10,507 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:54:10,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 73 [2022-12-13 17:54:10,522 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-12-13 17:54:10,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-12-13 17:54:10,887 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:54:10,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2022-12-13 17:54:10,891 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-12-13 17:54:10,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:54:10,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 17:54:11,091 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3792 (Array Int Int)) (v_ArrVal_3793 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= 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_3793)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3792)))) is different from true [2022-12-13 17:54:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:11,140 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:54:11,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2022-12-13 17:54:11,158 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:54:11,159 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-12-13 17:54:11,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:11,167 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-13 17:54:11,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-12-13 17:54:11,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:11,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:54:11,825 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-12-13 17:54:11,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-12-13 17:54:11,838 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-12-13 17:54:11,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-12-13 17:54:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 17:54:11,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:12,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748791243] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:12,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:54:12,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-12-13 17:54:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129481567] [2022-12-13 17:54:12,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:12,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 17:54:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 17:54:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3483, Unknown=3, NotChecked=118, Total=3782 [2022-12-13 17:54:12,521 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:54:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:16,088 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2022-12-13 17:54:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 17:54:16,088 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-12-13 17:54:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:54:16,089 INFO L225 Difference]: With dead ends: 130 [2022-12-13 17:54:16,089 INFO L226 Difference]: Without dead ends: 130 [2022-12-13 17:54:16,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=367, Invalid=6276, Unknown=3, NotChecked=160, Total=6806 [2022-12-13 17:54:16,092 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 52 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:54:16,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1653 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2025 Invalid, 0 Unknown, 113 Unchecked, 1.9s Time] [2022-12-13 17:54:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-13 17:54:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-12-13 17:54:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 120 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:54:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-12-13 17:54:16,096 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2022-12-13 17:54:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:54:16,096 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-12-13 17:54:16,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:54:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-12-13 17:54:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 17:54:16,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:54:16,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:54:16,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 17:54:16,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 17:54:16,298 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:54:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2022-12-13 17:54:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:16,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878382607] [2022-12-13 17:54:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:54:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:54:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:54:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:54:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:17,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878382607] [2022-12-13 17:54:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878382607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:17,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622372720] [2022-12-13 17:54:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:17,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:17,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:17,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:17,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 17:54:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:18,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-13 17:54:18,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:18,037 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-12-13 17:54:18,333 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:54:18,333 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-12-13 17:54:18,457 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-12-13 17:54:18,520 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:54:18,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:54:18,769 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 17:54:18,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2022-12-13 17:54:18,772 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-12-13 17:54:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:54:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:18,991 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:54:18,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-12-13 17:54:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:18,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2022-12-13 17:54:19,010 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 17:54:19,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-12-13 17:54:19,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-12-13 17:54:19,203 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-12-13 17:54:19,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2022-12-13 17:54:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:54:19,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:19,398 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| Int) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4092 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4091))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4092) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| |c_#StackHeapBarrier|)))) is different from false [2022-12-13 17:54:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622372720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:19,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:54:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2022-12-13 17:54:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034690829] [2022-12-13 17:54:19,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:19,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 17:54:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 17:54:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2683, Unknown=1, NotChecked=104, Total=2970 [2022-12-13 17:54:19,401 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:54:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:22,010 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-12-13 17:54:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 17:54:22,010 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-12-13 17:54:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:54:22,011 INFO L225 Difference]: With dead ends: 126 [2022-12-13 17:54:22,011 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 17:54:22,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=520, Invalid=4885, Unknown=1, NotChecked=144, Total=5550 [2022-12-13 17:54:22,012 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 586 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:54:22,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1153 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 17:54:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 17:54:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-12-13 17:54:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:54:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-12-13 17:54:22,014 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2022-12-13 17:54:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:54:22,014 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-12-13 17:54:22,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:54:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-12-13 17:54:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 17:54:22,015 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:54:22,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:54:22,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 17:54:22,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 17:54:22,216 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:54:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2022-12-13 17:54:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:22,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312415142] [2022-12-13 17:54:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:54:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:54:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:54:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:54:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312415142] [2022-12-13 17:54:23,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312415142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025305829] [2022-12-13 17:54:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:23,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:23,114 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:23,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 17:54:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:23,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-13 17:54:23,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:23,361 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-12-13 17:54:23,563 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-12-13 17:54:23,674 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:54:23,674 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-12-13 17:54:23,789 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-12-13 17:54:23,866 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:54:23,866 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 43 treesize of output 42 [2022-12-13 17:54:24,145 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 17:54:24,145 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 68 treesize of output 36 [2022-12-13 17:54:24,149 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-12-13 17:54:24,153 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-12-13 17:54:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:24,554 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:54:24,554 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 68 [2022-12-13 17:54:24,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:24,559 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 67 treesize of output 65 [2022-12-13 17:54:24,586 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-12-13 17:54:24,586 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-12-13 17:54:24,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 86 treesize of output 66 [2022-12-13 17:54:25,256 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 17:54:25,256 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 96 treesize of output 77 [2022-12-13 17:54:25,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:25,364 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:54:25,365 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 86 treesize of output 70 [2022-12-13 17:54:25,458 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-12-13 17:54:25,458 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 65 treesize of output 37 [2022-12-13 17:54:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:54:25,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:25,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4374 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4374) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 17:54:56,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025305829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:56,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:54:56,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-12-13 17:54:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909411530] [2022-12-13 17:54:56,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:56,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-13 17:54:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-13 17:54:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3889, Unknown=178, NotChecked=128, Total=4422 [2022-12-13 17:54:56,521 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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-12-13 17:55:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:05,224 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2022-12-13 17:55:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 17:55:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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 62 [2022-12-13 17:55:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:05,226 INFO L225 Difference]: With dead ends: 180 [2022-12-13 17:55:05,226 INFO L226 Difference]: Without dead ends: 180 [2022-12-13 17:55:05,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=999, Invalid=8724, Unknown=181, NotChecked=196, Total=10100 [2022-12-13 17:55:05,227 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1941 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:05,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 1019 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2079 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 17:55:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-13 17:55:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 113. [2022-12-13 17:55:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.288888888888889) internal successors, (116), 106 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:55:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2022-12-13 17:55:05,229 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2022-12-13 17:55:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:05,229 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2022-12-13 17:55:05,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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-12-13 17:55:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2022-12-13 17:55:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 17:55:05,230 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:05,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:05,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 17:55:05,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 17:55:05,432 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:55:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2022-12-13 17:55:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:05,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309876715] [2022-12-13 17:55:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:55:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:55:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:55:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:55:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309876715] [2022-12-13 17:55:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309876715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905770242] [2022-12-13 17:55:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:06,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:06,692 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:06,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 17:55:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 126 conjunts are in the unsatisfiable core [2022-12-13 17:55:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:06,962 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-12-13 17:55:07,008 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-12-13 17:55:07,129 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:55:07,129 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-12-13 17:55:07,267 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-12-13 17:55:07,274 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-12-13 17:55:07,386 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:55:07,386 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-12-13 17:55:07,524 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-12-13 17:55:07,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:07,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:55:07,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:07,914 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 68 treesize of output 31 [2022-12-13 17:55:07,920 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-12-13 17:55:07,925 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-12-13 17:55:08,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:08,310 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-12-13 17:55:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:08,322 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:55:08,322 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 74 treesize of output 62 [2022-12-13 17:55:08,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:08,344 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:55:08,344 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-12-13 17:55:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:08,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:55:08,991 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 17:55:08,992 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 106 treesize of output 85 [2022-12-13 17:55:09,002 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:09,002 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 31 [2022-12-13 17:55:09,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:09,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:55:09,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:09,124 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:55:09,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-12-13 17:55:09,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:09,216 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 53 treesize of output 24 [2022-12-13 17:55:09,219 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-12-13 17:55:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:55:09,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:09,448 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4673 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4673) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_4672 (Array Int Int)) (v_ArrVal_4673 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4673) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:55:11,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905770242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:11,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:55:11,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-12-13 17:55:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408849331] [2022-12-13 17:55:11,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:11,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-13 17:55:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-13 17:55:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4364, Unknown=61, NotChecked=134, Total=4830 [2022-12-13 17:55:11,073 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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-12-13 17:55:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:16,841 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2022-12-13 17:55:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 17:55:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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 62 [2022-12-13 17:55:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:16,842 INFO L225 Difference]: With dead ends: 250 [2022-12-13 17:55:16,843 INFO L226 Difference]: Without dead ends: 250 [2022-12-13 17:55:16,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1151, Invalid=9920, Unknown=63, NotChecked=208, Total=11342 [2022-12-13 17:55:16,844 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2567 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:16,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 882 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2024 Invalid, 2 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 17:55:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-12-13 17:55:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 117. [2022-12-13 17:55:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 110 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:55:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-12-13 17:55:16,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2022-12-13 17:55:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-12-13 17:55:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 51 states have internal predecessors, (110), 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-12-13 17:55:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-12-13 17:55:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 17:55:16,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:16,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:16,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 17:55:17,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:17,049 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:55:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2022-12-13 17:55:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:17,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671818786] [2022-12-13 17:55:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:55:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:55:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:55:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:55:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:19,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671818786] [2022-12-13 17:55:19,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671818786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:19,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15317787] [2022-12-13 17:55:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:19,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:19,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:19,185 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:19,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 17:55:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:19,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-13 17:55:19,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:19,454 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-12-13 17:55:19,718 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-12-13 17:55:19,880 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:55:19,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 17:55:20,021 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-12-13 17:55:20,117 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:20,118 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 53 treesize of output 50 [2022-12-13 17:55:20,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:20,444 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 29 [2022-12-13 17:55:20,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:55:20,450 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-12-13 17:55:20,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:20,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 17:55:20,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:20,755 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:55:20,756 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 80 treesize of output 57 [2022-12-13 17:55:20,770 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:55:20,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:55:21,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:21,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:55:21,686 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2022-12-13 17:55:21,687 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 154 treesize of output 77 [2022-12-13 17:55:21,697 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:21,698 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 31 [2022-12-13 17:55:21,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:21,798 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:55:21,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 60 [2022-12-13 17:55:21,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:21,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:55:21,896 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-12-13 17:55:22,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:22,115 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 24 [2022-12-13 17:55:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:55:22,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:22,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4969 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4969))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4970) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-12-13 17:55:22,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4966 Int) (v_ArrVal_4967 (Array Int Int)) (v_ArrVal_4969 (Array Int Int))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_4966)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4969))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4967) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4970) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-12-13 17:55:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15317787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:23,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:55:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-12-13 17:55:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722289363] [2022-12-13 17:55:23,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 17:55:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 17:55:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5409, Unknown=8, NotChecked=298, Total=6006 [2022-12-13 17:55:23,730 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:55:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:30,847 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2022-12-13 17:55:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 17:55:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2022-12-13 17:55:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:30,849 INFO L225 Difference]: With dead ends: 217 [2022-12-13 17:55:30,849 INFO L226 Difference]: Without dead ends: 217 [2022-12-13 17:55:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1009, Invalid=10121, Unknown=8, NotChecked=418, Total=11556 [2022-12-13 17:55:30,851 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1697 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:30,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1457 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-13 17:55:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-12-13 17:55:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2022-12-13 17:55:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 116 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:55:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2022-12-13 17:55:30,855 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 65 [2022-12-13 17:55:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:30,855 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2022-12-13 17:55:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:55:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-12-13 17:55:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:55:30,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:30,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:30,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 17:55:31,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 17:55:31,057 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:55:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2022-12-13 17:55:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479235524] [2022-12-13 17:55:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:55:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:55:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:55:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:55:31,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:31,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479235524] [2022-12-13 17:55:31,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479235524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:55:31,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:55:31,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:55:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414301092] [2022-12-13 17:55:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:55:31,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:55:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:55:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:55:31,174 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:55:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:31,252 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-12-13 17:55:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:55:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-12-13 17:55:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:31,253 INFO L225 Difference]: With dead ends: 125 [2022-12-13 17:55:31,253 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 17:55:31,253 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-12-13 17:55:31,254 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:31,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:55:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 17:55:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-12-13 17:55:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.25) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:55:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-12-13 17:55:31,257 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 68 [2022-12-13 17:55:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:31,257 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-12-13 17:55:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:55:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-12-13 17:55:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:55:31,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:31,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:31,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 17:55:31,258 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:55:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2022-12-13 17:55:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:31,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745697964] [2022-12-13 17:55:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:55:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:55:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:55:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:55:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745697964] [2022-12-13 17:55:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745697964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494057608] [2022-12-13 17:55:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:33,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:33,365 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:33,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 17:55:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:33,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 144 conjunts are in the unsatisfiable core [2022-12-13 17:55:33,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:33,584 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-12-13 17:55:33,638 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-12-13 17:55:33,782 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:55:33,782 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-12-13 17:55:33,988 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-12-13 17:55:34,110 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:55:34,110 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-12-13 17:55:34,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:55:34,345 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-12-13 17:55:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:34,354 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-12-13 17:55:34,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:34,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:55:34,493 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 20 treesize of output 22 [2022-12-13 17:55:34,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:34,913 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-12-13 17:55:34,917 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-12-13 17:55:34,922 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-12-13 17:55:34,925 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-12-13 17:55:35,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:35,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 17:55:35,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:35,325 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:55:35,325 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 78 treesize of output 59 [2022-12-13 17:55:35,345 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-12-13 17:55:35,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 1 case distinctions, treesize of input 20 treesize of output 23 [2022-12-13 17:55:35,352 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-12-13 17:55:35,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:35,373 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:55:35,373 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-12-13 17:55:36,152 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 17:55:36,152 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 128 treesize of output 101 [2022-12-13 17:55:36,171 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:55:36,172 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 48 treesize of output 49 [2022-12-13 17:55:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:36,178 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 32 treesize of output 34 [2022-12-13 17:55:36,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:36,282 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:55:36,282 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 74 treesize of output 62 [2022-12-13 17:55:36,288 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-12-13 17:55:36,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:36,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:55:36,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:55:36,386 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 55 treesize of output 26 [2022-12-13 17:55:36,388 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-12-13 17:55:36,511 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-12-13 17:55:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:55:36,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:36,571 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:55:36,578 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:55:36,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:55:36,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:55:36,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:55:36,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5435) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5433) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:55:36,638 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5433 (Array Int Int)) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5435) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5434) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5433) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 17:55:36,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5451 (Array Int Int)) (v_ArrVal_5453 (Array Int Int)) (v_ArrVal_5452 (Array Int Int)) (v_ArrVal_5433 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| Int) (v_ArrVal_5435 (Array Int Int)) (v_ArrVal_5434 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5438 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5451)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5452))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5453) .cse0 v_ArrVal_5435) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5436) (select (select (store (store .cse1 .cse0 v_ArrVal_5434) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse2 .cse0 v_ArrVal_5433) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-12-13 17:55:36,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494057608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:36,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:55:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 65 [2022-12-13 17:55:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743573520] [2022-12-13 17:55:36,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:36,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 17:55:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 17:55:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3941, Unknown=8, NotChecked=1064, Total=5256 [2022-12-13 17:55:36,713 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 states have internal predecessors, (118), 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-12-13 17:55:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:40,291 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-12-13 17:55:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 17:55:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 states have internal predecessors, (118), 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 68 [2022-12-13 17:55:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:40,292 INFO L225 Difference]: With dead ends: 183 [2022-12-13 17:55:40,292 INFO L226 Difference]: Without dead ends: 183 [2022-12-13 17:55:40,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=757, Invalid=7457, Unknown=8, NotChecked=1480, Total=9702 [2022-12-13 17:55:40,293 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 881 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:40,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1364 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 17:55:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-13 17:55:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2022-12-13 17:55:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:55:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-12-13 17:55:40,295 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 68 [2022-12-13 17:55:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:40,295 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-12-13 17:55:40,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.873015873015873) internal successors, (118), 56 states have internal predecessors, (118), 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-12-13 17:55:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-12-13 17:55:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 17:55:40,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:40,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:40,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 17:55:40,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 17:55:40,497 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:55:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2022-12-13 17:55:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:40,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563300203] [2022-12-13 17:55:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:55:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:55:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:55:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:55:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563300203] [2022-12-13 17:55:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563300203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133290471] [2022-12-13 17:55:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:43,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:43,162 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:43,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 17:55:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:43,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-13 17:55:43,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:43,456 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-12-13 17:55:43,460 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-12-13 17:55:43,510 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-12-13 17:55:43,512 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-12-13 17:55:43,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:43,679 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-12-13 17:55:43,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:43,685 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-12-13 17:55:43,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:43,891 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-12-13 17:55:43,893 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-12-13 17:55:44,053 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:55:44,053 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-12-13 17:55:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:44,076 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:55:44,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:55:44,743 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 18 [2022-12-13 17:55:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:44,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-12-13 17:55:44,755 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-12-13 17:55:44,757 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-12-13 17:55:45,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:45,290 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-12-13 17:55:45,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:45,297 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-12-13 17:55:45,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:45,310 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 36 [2022-12-13 17:55:45,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:45,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:45,333 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 17:55:45,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 17:55:46,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:46,427 INFO L321 Elim1Store]: treesize reduction 77, result has 34.2 percent of original size [2022-12-13 17:55:46,428 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 226 treesize of output 138 [2022-12-13 17:55:46,453 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 17:55:46,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 111 [2022-12-13 17:55:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:46,620 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:55:46,620 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 148 treesize of output 130 [2022-12-13 17:55:46,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:55:46,626 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 131 treesize of output 110 [2022-12-13 17:55:47,720 INFO L321 Elim1Store]: treesize reduction 48, result has 70.2 percent of original size [2022-12-13 17:55:47,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 285 treesize of output 279 [2022-12-13 17:55:47,813 INFO L321 Elim1Store]: treesize reduction 40, result has 68.0 percent of original size [2022-12-13 17:55:47,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 271 treesize of output 265 [2022-12-13 17:55:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:55:49,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:49,737 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 4))) (forall ((v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5739)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 17:55:53,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133290471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:53,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:55:53,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 67 [2022-12-13 17:55:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661524604] [2022-12-13 17:55:53,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:53,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-13 17:55:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 17:55:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6317, Unknown=69, NotChecked=160, Total=6806 [2022-12-13 17:55:53,820 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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-12-13 17:56:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:56:07,244 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2022-12-13 17:56:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 17:56:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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 70 [2022-12-13 17:56:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:56:07,245 INFO L225 Difference]: With dead ends: 223 [2022-12-13 17:56:07,245 INFO L226 Difference]: Without dead ends: 223 [2022-12-13 17:56:07,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1923 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1057, Invalid=12209, Unknown=78, NotChecked=228, Total=13572 [2022-12-13 17:56:07,246 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2137 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:56:07,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1470 Invalid, 3596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 17:56:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-13 17:56:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 131. [2022-12-13 17:56:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 124 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:56:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2022-12-13 17:56:07,248 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 70 [2022-12-13 17:56:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:56:07,249 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2022-12-13 17:56:07,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 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-12-13 17:56:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-12-13 17:56:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 17:56:07,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:56:07,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:56:07,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 17:56:07,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 17:56:07,451 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:56:07,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:56:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2022-12-13 17:56:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:56:07,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373755617] [2022-12-13 17:56:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:56:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:08,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:56:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:56:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:56:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:56:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:56:09,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373755617] [2022-12-13 17:56:09,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373755617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:09,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345786339] [2022-12-13 17:56:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:56:09,925 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:56:09,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 17:56:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:10,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-13 17:56:10,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:56:10,254 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-12-13 17:56:10,733 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:56:10,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 17:56:10,871 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-12-13 17:56:10,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:56:10,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:56:11,307 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 17:56:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 29 [2022-12-13 17:56:11,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:56:11,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:11,845 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:11,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 80 [2022-12-13 17:56:11,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:11,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-12-13 17:56:11,887 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-12-13 17:56:11,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-12-13 17:56:12,486 INFO L321 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2022-12-13 17:56:12,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 95 [2022-12-13 17:56:12,502 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:56:12,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 91 [2022-12-13 17:56:12,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:12,538 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:12,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 98 [2022-12-13 17:56:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:12,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-12-13 17:56:12,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2022-12-13 17:56:12,992 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-13 17:56:12,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 34 [2022-12-13 17:56:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:56:13,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:56:13,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array Int Int)) (v_ArrVal_6039 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6038))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-12-13 17:56:13,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array Int Int)) (v_ArrVal_6039 (Array Int Int)) (v_ArrVal_6037 Int) (v_ArrVal_6034 Int)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_6037)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6038))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_6034)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6039) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-12-13 17:56:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345786339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:14,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:56:14,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 65 [2022-12-13 17:56:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003751065] [2022-12-13 17:56:14,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:56:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-13 17:56:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:56:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-13 17:56:14,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5015, Unknown=8, NotChecked=286, Total=5550 [2022-12-13 17:56:14,225 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:56:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:56:24,343 INFO L93 Difference]: Finished difference Result 255 states and 283 transitions. [2022-12-13 17:56:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 17:56:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-12-13 17:56:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:56:24,344 INFO L225 Difference]: With dead ends: 255 [2022-12-13 17:56:24,345 INFO L226 Difference]: Without dead ends: 255 [2022-12-13 17:56:24,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2456 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1212, Invalid=11218, Unknown=10, NotChecked=442, Total=12882 [2022-12-13 17:56:24,345 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2435 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:56:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 1736 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3482 Invalid, 2 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 17:56:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-13 17:56:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 136. [2022-12-13 17:56:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 129 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:56:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2022-12-13 17:56:24,348 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 70 [2022-12-13 17:56:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:56:24,348 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2022-12-13 17:56:24,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:56:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2022-12-13 17:56:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:56:24,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:56:24,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:56:24,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 17:56:24,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:24,550 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:56:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:56:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2022-12-13 17:56:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:56:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059752979] [2022-12-13 17:56:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:56:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:56:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:56:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:56:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:56:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:56:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059752979] [2022-12-13 17:56:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059752979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904833371] [2022-12-13 17:56:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:56:26,910 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:56:26,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 17:56:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:27,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 159 conjunts are in the unsatisfiable core [2022-12-13 17:56:27,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:56:27,220 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-12-13 17:56:27,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-12-13 17:56:27,395 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:56:27,395 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-12-13 17:56:27,589 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-12-13 17:56:27,629 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:56:27,629 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-12-13 17:56:27,786 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-12-13 17:56:27,792 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-12-13 17:56:27,937 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:56:27,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:56:27,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 17:56:28,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:56:28,459 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-12-13 17:56:28,464 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:56:28,469 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-12-13 17:56:28,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:28,935 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:56:28,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 17:56:29,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:56:29,726 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-12-13 17:56:29,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 85 [2022-12-13 17:56:29,741 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 17:56:29,741 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 134 treesize of output 124 [2022-12-13 17:56:29,895 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:56:29,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 289 treesize of output 196 [2022-12-13 17:56:29,914 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 17:56:29,914 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 248 treesize of output 202 [2022-12-13 17:56:30,606 INFO L321 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2022-12-13 17:56:30,606 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 3 case distinctions, treesize of input 228 treesize of output 133 [2022-12-13 17:56:30,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:56:30,856 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 17:56:30,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 48 [2022-12-13 17:56:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:56:30,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:56:31,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6336) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) is different from false [2022-12-13 17:56:32,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6339))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-12-13 17:56:32,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6336) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6339))) (or (not (= (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-12-13 17:56:32,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| Int) (v_ArrVal_6336 (Array Int Int)) (v_ArrVal_6339 (Array Int Int)) (v_ArrVal_6349 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6340 (Array Int Int)) (v_ArrVal_6350 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6350)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6349))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (let ((.cse0 (store (store .cse6 .cse5 v_ArrVal_6336) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6339))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (let ((.cse1 (store (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select .cse6 .cse7) .cse8) 4) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6340))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| |c_#StackHeapBarrier|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) is different from false [2022-12-13 17:56:32,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904833371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:32,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:56:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 67 [2022-12-13 17:56:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016629460] [2022-12-13 17:56:32,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:56:32,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 17:56:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:56:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 17:56:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=5559, Unknown=50, NotChecked=612, Total=6480 [2022-12-13 17:56:32,392 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:56:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:56:39,075 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2022-12-13 17:56:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 17:56:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2022-12-13 17:56:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:56:39,076 INFO L225 Difference]: With dead ends: 193 [2022-12-13 17:56:39,076 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 17:56:39,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=840, Invalid=9837, Unknown=51, NotChecked=828, Total=11556 [2022-12-13 17:56:39,077 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 929 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:56:39,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1657 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 17:56:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 17:56:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2022-12-13 17:56:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.238938053097345) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:56:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-12-13 17:56:39,080 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 74 [2022-12-13 17:56:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:56:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-12-13 17:56:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 58 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:56:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-12-13 17:56:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:56:39,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:56:39,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:56:39,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 17:56:39,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:39,282 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:56:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:56:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -563328045, now seen corresponding path program 1 times [2022-12-13 17:56:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:56:39,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289925548] [2022-12-13 17:56:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:56:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:56:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:56:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:56:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:56:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:56:42,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289925548] [2022-12-13 17:56:42,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289925548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:42,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190516984] [2022-12-13 17:56:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:42,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:42,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:56:42,912 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:56:42,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 17:56:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:43,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 201 conjunts are in the unsatisfiable core [2022-12-13 17:56:43,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:56:43,223 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-12-13 17:56:43,279 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-12-13 17:56:43,431 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:56:43,431 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-12-13 17:56:43,569 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-12-13 17:56:43,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:43,642 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-12-13 17:56:43,750 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-12-13 17:56:44,182 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:56:44,183 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-12-13 17:56:44,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:56:44,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:56:44,414 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-12-13 17:56:44,425 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-12-13 17:56:44,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:56:44,584 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:56:44,584 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 100 treesize of output 91 [2022-12-13 17:56:44,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:44,596 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 45 treesize of output 38 [2022-12-13 17:56:44,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 17:56:45,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:56:45,119 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 85 treesize of output 40 [2022-12-13 17:56:45,124 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:56:45,127 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-12-13 17:56:45,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:45,705 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:45,705 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 91 treesize of output 73 [2022-12-13 17:56:45,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:45,722 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:56:45,723 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-12-13 17:56:45,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:45,730 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-12-13 17:56:45,741 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 22 treesize of output 24 [2022-12-13 17:56:47,123 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 17:56:47,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 250 treesize of output 193 [2022-12-13 17:56:47,160 INFO L321 Elim1Store]: treesize reduction 148, result has 16.9 percent of original size [2022-12-13 17:56:47,161 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 7 case distinctions, treesize of input 166 treesize of output 102 [2022-12-13 17:56:47,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:56:47,182 INFO L321 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2022-12-13 17:56:47,183 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 1 case distinctions, treesize of input 71 treesize of output 76 [2022-12-13 17:56:47,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:47,399 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:47,399 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 126 treesize of output 100 [2022-12-13 17:56:47,408 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 22 treesize of output 24 [2022-12-13 17:56:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:47,422 INFO L321 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-12-13 17:56:47,422 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 63 [2022-12-13 17:56:48,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:56:48,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:48,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:56:48,058 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 134 treesize of output 68 [2022-12-13 17:56:48,064 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 17:56:48,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-12-13 17:56:48,203 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-12-13 17:56:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:56:48,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:56:48,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (v_ArrVal_6655 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6655)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6653))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6654) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-12-13 17:56:48,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (v_ArrVal_6655 (Array Int Int)) (v_ArrVal_6649 (Array Int Int)) (v_ArrVal_6651 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6655)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6649) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6653))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_6651)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6654) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 17:56:50,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6654 (Array Int Int)) (v_ArrVal_6653 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| Int) (v_ArrVal_6655 (Array Int Int)) (v_ArrVal_6669 (Array Int Int)) (v_ArrVal_6668 (Array Int Int)) (v_ArrVal_6649 (Array Int Int)) (v_ArrVal_6651 Int) (v_ArrVal_6670 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6668)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6670))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse7 .cse10) .cse11))) (let ((.cse9 (select .cse8 .cse1)) (.cse2 (+ (select (select .cse8 .cse10) .cse11) 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse8 .cse1 (store .cse9 .cse2 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6655)) (.cse3 (store (store .cse7 .cse1 v_ArrVal_6649) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6653))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6669))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6651))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6654) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58|) 0)) (not (= 0 (select .cse9 .cse2))))))))) is different from false [2022-12-13 17:56:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190516984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:50,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:56:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 79 [2022-12-13 17:56:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327637761] [2022-12-13 17:56:50,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:56:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-13 17:56:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:56:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-13 17:56:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=7515, Unknown=8, NotChecked=528, Total=8372 [2022-12-13 17:56:50,035 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 states have internal predecessors, (134), 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-12-13 17:56:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:56:57,014 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-12-13 17:56:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 17:56:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 states have internal predecessors, (134), 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 74 [2022-12-13 17:56:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:56:57,015 INFO L225 Difference]: With dead ends: 191 [2022-12-13 17:56:57,015 INFO L226 Difference]: Without dead ends: 191 [2022-12-13 17:56:57,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1123, Invalid=13640, Unknown=11, NotChecked=726, Total=15500 [2022-12-13 17:56:57,016 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1247 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:56:57,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1597 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3307 Invalid, 4 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 17:56:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-13 17:56:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 135. [2022-12-13 17:56:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:56:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-12-13 17:56:57,018 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 74 [2022-12-13 17:56:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:56:57,019 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-12-13 17:56:57,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 69 states have internal predecessors, (134), 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-12-13 17:56:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-12-13 17:56:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 17:56:57,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:56:57,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:56:57,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 17:56:57,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 17:56:57,221 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:56:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:56:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash 364845693, now seen corresponding path program 3 times [2022-12-13 17:56:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:56:57,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135241831] [2022-12-13 17:56:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:56:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:56:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:56:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:56:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:56:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:56:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:56:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 17:56:57,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:56:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135241831] [2022-12-13 17:56:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135241831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:56:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325947135] [2022-12-13 17:56:57,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:56:57,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:56:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:56:57,407 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:56:57,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 17:56:57,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 17:56:57,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:56:57,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 137 conjunts are in the unsatisfiable core [2022-12-13 17:56:57,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:56:57,972 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-12-13 17:56:58,006 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 17:56:58,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2022-12-13 17:56:58,255 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-12-13 17:56:58,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-12-13 17:56:58,264 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:58,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-12-13 17:56:58,370 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:56:58,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-12-13 17:56:58,438 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-12-13 17:56:58,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-12-13 17:56:58,448 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-12-13 17:56:58,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:58,563 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2022-12-13 17:56:58,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 88 [2022-12-13 17:56:58,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 77 [2022-12-13 17:56:58,907 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2022-12-13 17:56:58,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 60 [2022-12-13 17:56:58,925 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-13 17:56:58,925 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-12-13 17:56:58,932 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:56:58,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-12-13 17:56:59,117 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_7032 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7032))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7033 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7033) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 17:56:59,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:59,168 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-12-13 17:56:59,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 164 treesize of output 126 [2022-12-13 17:56:59,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:59,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:56:59,177 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 17:56:59,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2022-12-13 17:56:59,220 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2022-12-13 17:56:59,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 117 [2022-12-13 17:56:59,793 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 17:56:59,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 164 [2022-12-13 17:57:00,064 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-12-13 17:57:00,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 71 [2022-12-13 17:57:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-12-13 17:57:00,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:57:00,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325947135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:57:00,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:57:00,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-12-13 17:57:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681905537] [2022-12-13 17:57:00,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:57:00,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 17:57:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:57:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 17:57:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1929, Unknown=4, NotChecked=88, Total=2162 [2022-12-13 17:57:00,742 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 17:57:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:57:02,532 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-12-13 17:57:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:57:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-12-13 17:57:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:57:02,533 INFO L225 Difference]: With dead ends: 102 [2022-12-13 17:57:02,533 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 17:57:02,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=264, Invalid=3515, Unknown=7, NotChecked=120, Total=3906 [2022-12-13 17:57:02,534 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:57:02,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 835 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1310 Invalid, 4 Unknown, 93 Unchecked, 1.2s Time] [2022-12-13 17:57:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 17:57:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-12-13 17:57:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:57:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-12-13 17:57:02,535 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 75 [2022-12-13 17:57:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:57:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-12-13 17:57:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 17:57:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-12-13 17:57:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 17:57:02,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:57:02,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:57:02,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 17:57:02,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 17:57:02,737 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:57:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:57:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash -192357779, now seen corresponding path program 2 times [2022-12-13 17:57:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:57:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326630533] [2022-12-13 17:57:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:57:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:57:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:57:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:57:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:57:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:57:08,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:57:08,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326630533] [2022-12-13 17:57:08,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326630533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:57:08,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117492708] [2022-12-13 17:57:08,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:57:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:57:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:57:08,301 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:57:08,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 17:57:08,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:57:08,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:57:08,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 190 conjunts are in the unsatisfiable core [2022-12-13 17:57:08,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:57:08,700 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-12-13 17:57:08,756 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-12-13 17:57:08,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:08,988 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-12-13 17:57:09,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-12-13 17:57:09,372 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-12-13 17:57:09,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:09,706 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 12 treesize of output 14 [2022-12-13 17:57:09,721 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:57:09,721 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-12-13 17:57:10,052 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-12-13 17:57:10,057 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-12-13 17:57:10,219 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:57:10,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-12-13 17:57:10,226 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-12-13 17:57:10,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:57:10,747 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-12-13 17:57:10,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:10,753 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:57:10,756 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-12-13 17:57:10,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:57:11,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:11,364 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-12-13 17:57:11,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:11,382 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:57:11,382 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 86 treesize of output 72 [2022-12-13 17:57:11,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:11,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:11,406 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 17:57:11,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-12-13 17:57:11,434 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:57:11,434 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-12-13 17:57:13,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:13,250 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2022-12-13 17:57:13,250 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 58 [2022-12-13 17:57:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:13,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:57:13,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:57:13,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:13,275 INFO L321 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2022-12-13 17:57:13,275 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 71 [2022-12-13 17:57:13,527 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:57:13,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 348 treesize of output 259 [2022-12-13 17:57:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:13,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:13,560 INFO L321 Elim1Store]: treesize reduction 98, result has 22.2 percent of original size [2022-12-13 17:57:13,560 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 291 treesize of output 226 [2022-12-13 17:57:16,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:57:16,032 INFO L321 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2022-12-13 17:57:16,033 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 338 treesize of output 163 [2022-12-13 17:57:16,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:16,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:16,052 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-12-13 17:57:16,053 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 8 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 51 [2022-12-13 17:57:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:57:16,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:57:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117492708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:57:29,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:57:29,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 41] total 87 [2022-12-13 17:57:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442650027] [2022-12-13 17:57:29,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:57:29,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-12-13 17:57:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:57:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-12-13 17:57:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=11001, Unknown=16, NotChecked=0, Total=11342 [2022-12-13 17:57:29,368 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:57:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:57:48,621 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-12-13 17:57:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 17:57:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2022-12-13 17:57:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:57:48,622 INFO L225 Difference]: With dead ends: 119 [2022-12-13 17:57:48,622 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 17:57:48,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=1026, Invalid=19262, Unknown=18, NotChecked=0, Total=20306 [2022-12-13 17:57:48,623 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1055 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 4361 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 4401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4361 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:57:48,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1483 Invalid, 4401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4361 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-12-13 17:57:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 17:57:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2022-12-13 17:57:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:57:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-12-13 17:57:48,625 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 76 [2022-12-13 17:57:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:57:48,625 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-12-13 17:57:48,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 78 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:57:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-12-13 17:57:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 17:57:48,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:57:48,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:57:48,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 17:57:48,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:57:48,826 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:57:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:57:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash -192357780, now seen corresponding path program 2 times [2022-12-13 17:57:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:57:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754552315] [2022-12-13 17:57:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:57:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:57:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:57:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:57:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:57:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:57:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:57:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:57:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754552315] [2022-12-13 17:57:52,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754552315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:57:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908280572] [2022-12-13 17:57:52,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:57:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:57:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:57:52,413 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:57:52,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 17:57:52,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:57:52,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:57:52,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 155 conjunts are in the unsatisfiable core [2022-12-13 17:57:52,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:57:53,204 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-12-13 17:57:53,355 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:57:53,355 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-12-13 17:57:53,565 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-12-13 17:57:53,572 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-12-13 17:57:53,670 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:57:53,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-12-13 17:57:53,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 17:57:54,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:57:54,089 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-12-13 17:57:54,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:57:54,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:57:54,098 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-12-13 17:57:54,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:54,769 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:57:54,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-12-13 17:57:54,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:54,784 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-12-13 17:57:54,784 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 2 case distinctions, treesize of input 25 treesize of output 38 [2022-12-13 17:57:54,817 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 17:57:54,817 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 34 treesize of output 57 [2022-12-13 17:57:55,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:57:56,006 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-12-13 17:57:56,007 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 158 treesize of output 92 [2022-12-13 17:57:56,029 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 17:57:56,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 142 [2022-12-13 17:57:56,238 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:57:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 212 [2022-12-13 17:57:56,261 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 17:57:56,261 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 269 treesize of output 221 [2022-12-13 17:57:57,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:57,289 INFO L321 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2022-12-13 17:57:57,289 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 249 treesize of output 150 [2022-12-13 17:57:57,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:57:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:57:57,765 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 17:57:57,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 56 [2022-12-13 17:57:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:57:58,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:57:58,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7634 (Array Int Int)) (v_ArrVal_7635 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_38| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7635))) (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_38|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_38|)) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7634))) (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_38| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4))))) 1)))) is different from false [2022-12-13 17:58:01,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| Int) (v_ArrVal_7645 (Array Int Int)) (v_ArrVal_7634 (Array Int Int)) (v_ArrVal_7646 (Array Int Int)) (v_ArrVal_7635 (Array Int Int)) (v_ArrVal_7633 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_38| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7646)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7645))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ 4 (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (let ((.cse0 (store (store .cse6 .cse5 v_ArrVal_7633) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7635))) (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_38|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_38|)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| 1) (let ((.cse1 (store (store .cse4 .cse5 (store (select .cse4 .cse5) (+ 4 (select (select .cse6 .cse7) .cse8)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| v_ArrVal_7634))) (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_38| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4))))) 1) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))))))) is different from false [2022-12-13 17:58:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908280572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:58:01,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:58:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 76 [2022-12-13 17:58:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092982230] [2022-12-13 17:58:01,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:58:01,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-13 17:58:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:58:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-13 17:58:01,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7563, Unknown=28, NotChecked=350, Total=8190 [2022-12-13 17:58:01,197 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 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-12-13 17:58:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:58:13,159 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-12-13 17:58:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 17:58:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2022-12-13 17:58:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:58:13,160 INFO L225 Difference]: With dead ends: 109 [2022-12-13 17:58:13,160 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 17:58:13,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=828, Invalid=13430, Unknown=30, NotChecked=474, Total=14762 [2022-12-13 17:58:13,161 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 765 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 48 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:58:13,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1315 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3229 Invalid, 2 Unknown, 0 Unchecked, 2.9s Time] [2022-12-13 17:58:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 17:58:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-12-13 17:58:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 92 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-12-13 17:58:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-12-13 17:58:13,164 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 76 [2022-12-13 17:58:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:58:13,165 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-12-13 17:58:13,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 74 states have (on average 1.864864864864865) internal successors, (138), 68 states have internal predecessors, (138), 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-12-13 17:58:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-12-13 17:58:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 17:58:13,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:58:13,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:58:13,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 17:58:13,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:58:13,366 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:58:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:58:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1990095940, now seen corresponding path program 2 times [2022-12-13 17:58:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:58:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474881017] [2022-12-13 17:58:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:58:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:58:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:58:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:58:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:58:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:58:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:58:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474881017] [2022-12-13 17:58:16,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474881017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:58:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166981308] [2022-12-13 17:58:16,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:58:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:58:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:58:16,923 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:58:16,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 17:58:17,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:58:17,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:58:17,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 190 conjunts are in the unsatisfiable core [2022-12-13 17:58:17,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:58:17,320 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-12-13 17:58:17,380 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-12-13 17:58:17,479 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:58:17,479 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-12-13 17:58:17,762 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:58:17,762 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-12-13 17:58:18,014 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-12-13 17:58:18,020 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-12-13 17:58:18,147 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:58:18,147 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 56 treesize of output 53 [2022-12-13 17:58:18,151 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-12-13 17:58:18,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:18,643 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 62 treesize of output 29 [2022-12-13 17:58:18,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:58:18,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:18,652 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-12-13 17:58:18,953 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-12-13 17:58:19,144 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:58:19,144 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-12-13 17:58:20,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:20,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:58:20,152 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-12-13 17:58:20,152 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 190 treesize of output 104 [2022-12-13 17:58:20,177 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-12-13 17:58:20,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 139 [2022-12-13 17:58:20,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:58:20,344 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:58:20,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 406 treesize of output 271 [2022-12-13 17:58:20,369 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-12-13 17:58:20,369 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 373 treesize of output 301 [2022-12-13 17:58:20,381 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 121 treesize of output 86 [2022-12-13 17:58:21,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:58:21,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:21,987 INFO L321 Elim1Store]: treesize reduction 93, result has 10.6 percent of original size [2022-12-13 17:58:21,987 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 305 treesize of output 120 [2022-12-13 17:58:21,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:22,004 INFO L321 Elim1Store]: treesize reduction 24, result has 22.6 percent of original size [2022-12-13 17:58:22,005 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 8 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 37 [2022-12-13 17:58:22,157 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-12-13 17:58:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:58:22,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:58:26,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:26,656 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 1015 treesize of output 1008 [2022-12-13 17:58:26,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:26,693 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 16792 treesize of output 15856 [2022-12-13 17:58:26,714 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 19144 treesize of output 15868 [2022-12-13 17:58:26,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:26,756 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 6213 treesize of output 5749 [2022-12-13 17:58:26,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:58:26,885 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 15891 treesize of output 14491 [2022-12-13 17:58:43,510 WARN L233 SmtUtils]: Spent 14.65s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:58:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166981308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:58:43,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:58:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39] total 73 [2022-12-13 17:58:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686948222] [2022-12-13 17:58:43,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:58:43,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-13 17:58:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:58:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-13 17:58:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=7016, Unknown=46, NotChecked=0, Total=7310 [2022-12-13 17:58:43,513 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 73 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 64 states have internal predecessors, (131), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:59:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:59:05,743 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2022-12-13 17:59:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 17:59:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 64 states have internal predecessors, (131), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 80 [2022-12-13 17:59:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:59:05,744 INFO L225 Difference]: With dead ends: 142 [2022-12-13 17:59:05,744 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 17:59:05,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=726, Invalid=12800, Unknown=46, NotChecked=0, Total=13572 [2022-12-13 17:59:05,745 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 915 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:59:05,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1333 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-12-13 17:59:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 17:59:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2022-12-13 17:59:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:59:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-12-13 17:59:05,747 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 80 [2022-12-13 17:59:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:59:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-12-13 17:59:05,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 64 states have internal predecessors, (131), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:59:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-12-13 17:59:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 17:59:05,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:59:05,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:59:05,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 17:59:05,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 17:59:05,950 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 17:59:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:59:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1990140642, now seen corresponding path program 2 times [2022-12-13 17:59:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:59:05,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531043065] [2022-12-13 17:59:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:59:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:59:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:59:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:59:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:59:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:59:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:59:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:59:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:59:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:59:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:59:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531043065] [2022-12-13 17:59:18,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531043065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:59:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803862685] [2022-12-13 17:59:18,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:59:18,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:59:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:59:18,551 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:59:18,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 17:59:18,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:59:18,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:59:18,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 195 conjunts are in the unsatisfiable core [2022-12-13 17:59:18,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:59:18,967 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-12-13 17:59:19,267 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-12-13 17:59:20,260 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:59:20,260 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-12-13 17:59:21,432 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-12-13 17:59:22,297 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:59:22,298 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-12-13 17:59:23,585 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-12-13 17:59:23,634 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-12-13 17:59:24,202 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:59:24,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:59:24,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 17:59:26,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:59:26,180 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-12-13 17:59:26,190 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:59:26,199 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-12-13 17:59:28,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2022-12-13 17:59:28,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:59:28,731 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 17:59:28,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 72 [2022-12-13 17:59:28,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:28,831 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:59:28,831 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-12-13 17:59:33,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:33,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:59:33,427 INFO L321 Elim1Store]: treesize reduction 167, result has 16.1 percent of original size [2022-12-13 17:59:33,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 192 treesize of output 116 [2022-12-13 17:59:33,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:33,451 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:59:33,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 98 [2022-12-13 17:59:34,211 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-12-13 17:59:34,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 446 treesize of output 138 [2022-12-13 17:59:34,327 INFO L321 Elim1Store]: treesize reduction 224, result has 10.8 percent of original size [2022-12-13 17:59:34,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 331 treesize of output 189 [2022-12-13 17:59:39,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:59:39,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:39,718 INFO L321 Elim1Store]: treesize reduction 208, result has 6.3 percent of original size [2022-12-13 17:59:39,718 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 14 new quantified variables, introduced 21 case distinctions, treesize of input 329 treesize of output 135 [2022-12-13 17:59:39,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:59:39,797 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-12-13 17:59:39,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 43 [2022-12-13 17:59:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 28 refuted. 7 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:59:40,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:00:29,028 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:02:38,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803862685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:02:38,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:02:38,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2022-12-13 18:02:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90355892] [2022-12-13 18:02:38,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:02:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-13 18:02:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:02:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-13 18:02:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=8400, Unknown=62, NotChecked=0, Total=8742 [2022-12-13 18:02:38,236 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 78 states, 76 states have (on average 1.894736842105263) internal successors, (144), 69 states have internal predecessors, (144), 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-12-13 18:03:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:11,296 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-12-13 18:03:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 18:03:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 76 states have (on average 1.894736842105263) internal successors, (144), 69 states have internal predecessors, (144), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 80 [2022-12-13 18:03:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:11,297 INFO L225 Difference]: With dead ends: 94 [2022-12-13 18:03:11,297 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 18:03:11,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3012 ImplicationChecksByTransitivity, 221.9s TimeCoverageRelationStatistics Valid=947, Invalid=14741, Unknown=62, NotChecked=0, Total=15750 [2022-12-13 18:03:11,299 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 850 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:11,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1203 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2835 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-12-13 18:03:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 18:03:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-12-13 18:03:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 77 states have internal predecessors, (78), 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-12-13 18:03:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-12-13 18:03:11,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 80 [2022-12-13 18:03:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:11,303 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-12-13 18:03:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 76 states have (on average 1.894736842105263) internal successors, (144), 69 states have internal predecessors, (144), 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-12-13 18:03:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-12-13 18:03:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 18:03:11,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:11,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:11,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 18:03:11,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 18:03:11,505 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1563433118, now seen corresponding path program 1 times [2022-12-13 18:03:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:11,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245684643] [2022-12-13 18:03:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 18:03:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:12,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245684643] [2022-12-13 18:03:12,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245684643] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:12,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770824716] [2022-12-13 18:03:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:12,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:12,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:12,059 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:12,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 18:03:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:12,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 18:03:12,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 18:03:13,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:03:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 18:03:14,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770824716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:03:14,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:03:14,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 18:03:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019336070] [2022-12-13 18:03:14,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:03:14,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:03:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:03:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:03:14,099 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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-12-13 18:03:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:14,506 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-12-13 18:03:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:03:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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 81 [2022-12-13 18:03:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:14,507 INFO L225 Difference]: With dead ends: 80 [2022-12-13 18:03:14,507 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 18:03:14,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:03:14,508 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 51 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:14,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 491 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:03:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 18:03:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 18:03:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 75 states have internal predecessors, (76), 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-12-13 18:03:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-12-13 18:03:14,510 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 81 [2022-12-13 18:03:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:14,510 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-12-13 18:03:14,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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-12-13 18:03:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-12-13 18:03:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 18:03:14,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:14,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:14,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 18:03:14,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 18:03:14,712 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1611808746, now seen corresponding path program 1 times [2022-12-13 18:03:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:14,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528825841] [2022-12-13 18:03:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 18:03:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:15,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528825841] [2022-12-13 18:03:15,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528825841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:15,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892223308] [2022-12-13 18:03:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:15,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:15,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:15,066 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:15,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 18:03:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:15,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 18:03:15,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:15,575 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-12-13 18:03:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:03:15,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:03:15,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892223308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:03:15,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:03:15,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-12-13 18:03:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91610216] [2022-12-13 18:03:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:03:15,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:03:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:03:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:03:15,594 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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-12-13 18:03:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:16,161 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-12-13 18:03:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:03:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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 84 [2022-12-13 18:03:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:16,162 INFO L225 Difference]: With dead ends: 89 [2022-12-13 18:03:16,162 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 18:03:16,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:03:16,162 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 41 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:16,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 209 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:03:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 18:03:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-12-13 18:03:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 76 states have internal predecessors, (79), 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-12-13 18:03:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-12-13 18:03:16,164 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 84 [2022-12-13 18:03:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:16,165 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-12-13 18:03:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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-12-13 18:03:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-12-13 18:03:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 18:03:16,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:16,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:16,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 18:03:16,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 18:03:16,367 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1611808747, now seen corresponding path program 1 times [2022-12-13 18:03:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:16,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541347614] [2022-12-13 18:03:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:16,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:17,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 18:03:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:17,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541347614] [2022-12-13 18:03:17,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541347614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125585790] [2022-12-13 18:03:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:17,011 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:17,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 18:03:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:17,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 18:03:17,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:17,690 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-12-13 18:03:17,698 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-12-13 18:03:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 18:03:17,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:03:18,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:03:18,401 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-12-13 18:03:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 18:03:18,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125585790] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:18,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:03:18,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 16 [2022-12-13 18:03:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222115918] [2022-12-13 18:03:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:03:18,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:03:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:03:18,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:03:18,687 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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-12-13 18:03:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:19,764 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-12-13 18:03:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:03:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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 84 [2022-12-13 18:03:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:19,765 INFO L225 Difference]: With dead ends: 84 [2022-12-13 18:03:19,766 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 18:03:19,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-12-13 18:03:19,766 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 47 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:19,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 222 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:03:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 18:03:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-12-13 18:03:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 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-12-13 18:03:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-12-13 18:03:19,768 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 84 [2022-12-13 18:03:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:19,768 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-12-13 18:03:19,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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-12-13 18:03:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-12-13 18:03:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 18:03:19,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:19,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:19,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 18:03:19,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 18:03:19,969 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1573537812, now seen corresponding path program 1 times [2022-12-13 18:03:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:19,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188222324] [2022-12-13 18:03:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 18:03:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188222324] [2022-12-13 18:03:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188222324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161326508] [2022-12-13 18:03:22,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:22,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:22,932 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:22,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 18:03:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:23,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 18:03:23,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:23,408 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-12-13 18:03:23,726 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_9339 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_9339))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 18:03:23,815 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-12-13 18:03:23,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_9340 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_9340))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 18:03:24,035 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-12-13 18:03:24,171 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_9341 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_9341))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 18:03:24,253 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-12-13 18:03:24,799 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:03:24,799 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-12-13 18:03:25,163 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-12-13 18:03:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 21 not checked. [2022-12-13 18:03:25,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:03:25,621 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-12-13 18:03:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:03:28,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161326508] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:28,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:03:28,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [25, 12] total 38 [2022-12-13 18:03:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500725936] [2022-12-13 18:03:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:03:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:03:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:03:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1081, Unknown=3, NotChecked=204, Total=1406 [2022-12-13 18:03:28,474 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 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-12-13 18:03:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:29,338 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-12-13 18:03:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:03:29,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 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 85 [2022-12-13 18:03:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:29,339 INFO L225 Difference]: With dead ends: 81 [2022-12-13 18:03:29,339 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 18:03:29,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=163, Invalid=1406, Unknown=3, NotChecked=234, Total=1806 [2022-12-13 18:03:29,340 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:29,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 129 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:03:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 18:03:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-13 18:03:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 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-12-13 18:03:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-12-13 18:03:29,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 85 [2022-12-13 18:03:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:29,342 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-12-13 18:03:29,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 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-12-13 18:03:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-12-13 18:03:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 18:03:29,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:29,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:29,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 18:03:29,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:29,544 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1534985142, now seen corresponding path program 1 times [2022-12-13 18:03:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:29,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237882914] [2022-12-13 18:03:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 18:03:31,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:31,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237882914] [2022-12-13 18:03:31,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237882914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:31,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257536620] [2022-12-13 18:03:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:31,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:31,772 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:31,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 18:03:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:32,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 18:03:32,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:33,451 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-12-13 18:03:33,462 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-12-13 18:03:33,782 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9620 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9620) |c_#memory_$Pointer$.offset|)) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9619 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9619)))) is different from true [2022-12-13 18:03:33,808 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9622 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9622))) (exists ((v_ArrVal_9621 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9621)))) is different from true [2022-12-13 18:03:33,834 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9623 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9623))) (exists ((v_ArrVal_9624 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9624) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 18:03:33,860 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9623 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_9623))) (exists ((v_ArrVal_9624 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_9624) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 18:03:33,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:03:33,894 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-12-13 18:03:33,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:03:33,919 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-12-13 18:03:34,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:03:34,447 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-12-13 18:03:34,943 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 18:03:34,943 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-12-13 18:03:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:03:35,124 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-12-13 18:03:35,285 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-12-13 18:03:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 5 not checked. [2022-12-13 18:03:35,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:03:35,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9627 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_9627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) is different from false [2022-12-13 18:03:36,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9636 (Array Int Int)) (v_ArrVal_9637 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_9625 Int) (v_ArrVal_9627 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| Int)) (let ((.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_9637) |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| |c_#StackHeapBarrier|)) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_9636))) (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_9625))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_9627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2022-12-13 18:03:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257536620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:36,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:03:36,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 39 [2022-12-13 18:03:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379277166] [2022-12-13 18:03:36,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:03:36,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 18:03:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 18:03:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1427, Unknown=13, NotChecked=486, Total=2070 [2022-12-13 18:03:36,820 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 34 states have internal predecessors, (109), 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-12-13 18:03:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:03:41,854 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-12-13 18:03:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:03:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 34 states have internal predecessors, (109), 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 86 [2022-12-13 18:03:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:03:41,855 INFO L225 Difference]: With dead ends: 83 [2022-12-13 18:03:41,856 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 18:03:41,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=384, Invalid=2596, Unknown=14, NotChecked=666, Total=3660 [2022-12-13 18:03:41,856 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 524 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:03:41,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 364 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 705 Invalid, 0 Unknown, 278 Unchecked, 2.1s Time] [2022-12-13 18:03:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 18:03:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-13 18:03:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 78 states have internal predecessors, (79), 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-12-13 18:03:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-12-13 18:03:41,858 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 86 [2022-12-13 18:03:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:03:41,858 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-12-13 18:03:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 34 states have internal predecessors, (109), 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-12-13 18:03:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-12-13 18:03:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 18:03:41,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:03:41,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:03:41,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 18:03:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:42,060 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:03:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:03:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash -339898963, now seen corresponding path program 1 times [2022-12-13 18:03:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:03:42,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197260501] [2022-12-13 18:03:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:03:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:03:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:03:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:03:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 18:03:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:03:46,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197260501] [2022-12-13 18:03:46,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197260501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:46,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98458408] [2022-12-13 18:03:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:03:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:03:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:03:46,039 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:03:46,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 18:03:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:03:46,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 18:03:46,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:03:47,966 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-12-13 18:03:48,375 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9906 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9906)))) is different from true [2022-12-13 18:03:48,396 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9907 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9907) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 18:03:48,416 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9908 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9908)))) is different from true [2022-12-13 18:03:48,436 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9908 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_9908)))) is different from true [2022-12-13 18:03:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:03:48,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 18:03:49,911 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 18:03:49,911 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-12-13 18:03:49,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:03:49,962 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-12-13 18:03:50,444 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-12-13 18:03:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 5 not checked. [2022-12-13 18:03:51,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:03:51,469 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9911 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_9911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 18:03:59,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9911 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_85| Int) (v_ArrVal_9916 (Array Int Int)) (v_ArrVal_9910 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_85| v_ArrVal_9916))) (let ((.cse0 (select .cse2 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= 0 (select .cse0 .cse1))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_85| |c_#StackHeapBarrier|)) (<= (+ (select (select (store (store .cse2 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_9910)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_85| v_ArrVal_9911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|))))) is different from false [2022-12-13 18:03:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98458408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:03:59,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:03:59,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2022-12-13 18:03:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648176721] [2022-12-13 18:03:59,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:03:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 18:03:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:03:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 18:03:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1806, Unknown=24, NotChecked=546, Total=2550 [2022-12-13 18:03:59,097 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 45 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 39 states have internal predecessors, (132), 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-12-13 18:04:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:09,450 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-12-13 18:04:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 18:04:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 39 states have internal predecessors, (132), 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 87 [2022-12-13 18:04:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:09,451 INFO L225 Difference]: With dead ends: 85 [2022-12-13 18:04:09,451 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 18:04:09,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=503, Invalid=3402, Unknown=25, NotChecked=762, Total=4692 [2022-12-13 18:04:09,452 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 616 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:09,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 507 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1014 Invalid, 0 Unknown, 311 Unchecked, 3.6s Time] [2022-12-13 18:04:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 18:04:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-12-13 18:04:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 79 states have internal predecessors, (80), 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-12-13 18:04:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-12-13 18:04:09,455 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 87 [2022-12-13 18:04:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:09,456 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-12-13 18:04:09,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 39 states have internal predecessors, (132), 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-12-13 18:04:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-12-13 18:04:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 18:04:09,456 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:09,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:09,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-13 18:04:09,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:09,658 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:04:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1603060623, now seen corresponding path program 1 times [2022-12-13 18:04:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:09,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906983347] [2022-12-13 18:04:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:04:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:04:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:04:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:04:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906983347] [2022-12-13 18:04:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906983347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887132677] [2022-12-13 18:04:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:18,955 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:04:18,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 18:04:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:19,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 141 conjunts are in the unsatisfiable core [2022-12-13 18:04:19,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:04:19,315 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-12-13 18:04:19,639 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-12-13 18:04:20,537 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 18:04:20,537 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-12-13 18:04:21,726 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-12-13 18:04:22,564 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 18:04:22,564 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-12-13 18:04:23,555 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-12-13 18:04:24,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:04:24,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 18:04:26,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:04:26,023 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 59 treesize of output 26 [2022-12-13 18:04:26,033 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-12-13 18:04:26,042 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-12-13 18:04:27,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:27,922 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 18:04:27,922 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 67 treesize of output 50 [2022-12-13 18:04:27,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:28,007 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 18:04:28,007 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-12-13 18:04:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:28,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 18:04:31,779 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:04:31,779 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 91 [2022-12-13 18:04:31,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:04:31,858 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 47 treesize of output 48 [2022-12-13 18:04:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:32,328 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:04:32,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 66 [2022-12-13 18:04:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:32,342 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 33 treesize of output 33 [2022-12-13 18:04:34,037 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-12-13 18:04:34,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:04:34,989 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 18:04:34,990 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 66 treesize of output 30 [2022-12-13 18:04:35,731 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-12-13 18:04:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 18:04:35,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:04:37,063 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10202 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_10201 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10201))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1)) (not (= .cse1 0))))) (forall ((v_ArrVal_10202 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_10201 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10201))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (+ .cse4 4)) .cse3))))) (not (= .cse4 0)))))) is different from false [2022-12-13 18:04:37,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:04:37,943 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-12-13 18:04:38,099 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_129 (Array Int Int)) (v_prenex_130 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_130) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_131) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_129))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (+ .cse2 4)) .cse1)))) (not (= .cse2 0))))) (forall ((v_ArrVal_10202 (Array Int Int)) (v_ArrVal_10201 (Array Int Int)) (v_ArrVal_10200 (Array Int Int)) (v_ArrVal_10199 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10200) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10199) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10201))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse3 4))))))) is different from false [2022-12-13 18:04:39,751 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (and (forall ((v_prenex_129 (Array Int Int)) (v_prenex_130 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_prenex_130) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 0)) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse3 v_prenex_131) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_129))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse1 .cse2) (+ .cse0 4)) .cse2))))))) (forall ((v_ArrVal_10202 (Array Int Int)) (v_ArrVal_10201 (Array Int Int)) (v_ArrVal_10200 (Array Int Int)) (v_ArrVal_10199 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_10200) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse3 (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_10199) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10201))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse5 4))) (not (= .cse5 0))))))) is different from false [2022-12-13 18:04:39,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_10202 (Array Int Int)) (v_ArrVal_10201 (Array Int Int)) (v_ArrVal_10200 (Array Int Int)) (v_ArrVal_10199 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10200) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10199) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10201))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse2 4))) (not (= .cse2 0))))) (forall ((v_prenex_129 (Array Int Int)) (v_prenex_130 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_130) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_prenex_131) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_129))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse3 .cse4) (+ .cse5 4)) .cse4)))) (not (= .cse5 0))))))) is different from false [2022-12-13 18:04:39,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_10202 (Array Int Int)) (v_ArrVal_10201 (Array Int Int)) (v_ArrVal_10200 (Array Int Int)) (v_ArrVal_10199 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_10200) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 0)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10199) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10201))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) .cse2)))) (forall ((v_prenex_129 (Array Int Int)) (v_prenex_130 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_130) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 0)) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse2 v_prenex_131) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_129))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse4 (select (select .cse5 .cse4) (+ .cse3 4))))))))))) is different from false [2022-12-13 18:04:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887132677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:40,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:04:40,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 37] total 77 [2022-12-13 18:04:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664882065] [2022-12-13 18:04:40,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:04:40,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-13 18:04:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-13 18:04:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=6291, Unknown=44, NotChecked=820, Total=7482 [2022-12-13 18:04:40,953 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 78 states, 75 states have (on average 2.026666666666667) internal successors, (152), 69 states have internal predecessors, (152), 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-12-13 18:05:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:05:03,792 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-12-13 18:05:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 18:05:03,792 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 75 states have (on average 2.026666666666667) internal successors, (152), 69 states have internal predecessors, (152), 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 90 [2022-12-13 18:05:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:05:03,793 INFO L225 Difference]: With dead ends: 89 [2022-12-13 18:05:03,793 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 18:05:03,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 113 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3361 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=1051, Invalid=10915, Unknown=44, NotChecked=1100, Total=13110 [2022-12-13 18:05:03,794 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 607 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:05:03,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 883 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-12-13 18:05:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 18:05:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-12-13 18:05:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 82 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-12-13 18:05:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-12-13 18:05:03,796 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 90 [2022-12-13 18:05:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:05:03,796 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-12-13 18:05:03,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 75 states have (on average 2.026666666666667) internal successors, (152), 69 states have internal predecessors, (152), 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-12-13 18:05:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-12-13 18:05:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 18:05:03,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:05:03,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:05:03,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 18:05:03,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:05:03,997 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:05:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:05:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1603060624, now seen corresponding path program 1 times [2022-12-13 18:05:03,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:05:03,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705033620] [2022-12-13 18:05:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:05:03,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:05:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:05:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:05:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:05:10,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:05:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:05:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:05:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:05:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 18:05:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:05:13,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705033620] [2022-12-13 18:05:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705033620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:05:13,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430379021] [2022-12-13 18:05:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:05:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:05:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:05:13,096 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:05:13,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 18:05:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:05:13,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 145 conjunts are in the unsatisfiable core [2022-12-13 18:05:13,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:05:13,564 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-12-13 18:05:13,850 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-12-13 18:05:14,716 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 18:05:14,716 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-12-13 18:05:16,169 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-12-13 18:05:16,958 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 18:05:16,958 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-12-13 18:05:18,295 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-12-13 18:05:18,373 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-12-13 18:05:18,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:05:18,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2022-12-13 18:05:18,998 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 41 treesize of output 41 [2022-12-13 18:05:21,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:05:21,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:05:21,220 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 129 treesize of output 56 [2022-12-13 18:05:21,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 22 [2022-12-13 18:05:21,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-13 18:05:21,254 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-12-13 18:05:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:05:23,419 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 18:05:23,419 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 39 treesize of output 39 [2022-12-13 18:05:23,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ 4 .cse1))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_#memory_$Pointer$.offset|)) (.cse0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse3) .cse6)) (.cse2 (select .cse5 .cse6))) (and (<= 0 .cse0) (<= .cse1 0) (not (= .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse2 .cse3)) (<= 0 .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (<= (+ .cse0 12) (select |c_#length| .cse2))))))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse8 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse10)) (.cse7 (select .cse5 .cse10))) (and (not (= .cse7 .cse3)) (not (= .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (<= 0 .cse8) (<= 0 .cse9) (<= (+ 12 .cse9) (select |c_#length| .cse7)) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse8 0))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-12-13 18:05:23,914 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ 4 .cse1))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_#memory_$Pointer$.offset|)) (.cse0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse3) .cse6)) (.cse2 (select .cse5 .cse6))) (and (<= 0 .cse0) (<= .cse1 0) (not (= .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse2 .cse3)) (<= 0 .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (<= (+ .cse0 12) (select |c_#length| .cse2))))))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse8 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse10)) (.cse7 (select .cse5 .cse10))) (and (not (= .cse7 .cse3)) (not (= .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (<= 0 .cse8) (<= 0 .cse9) (<= (+ 12 .cse9) (select |c_#length| .cse7)) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse8 0))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-12-13 18:05:27,467 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:05:27,468 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 167 treesize of output 138 [2022-12-13 18:05:27,537 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 18:05:27,537 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 145 treesize of output 131 [2022-12-13 18:05:28,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:05:28,124 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:05:28,124 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 133 treesize of output 113 [2022-12-13 18:05:28,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:05:28,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 116 [2022-12-13 18:05:31,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:05:31,461 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-13 18:05:31,461 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 127 treesize of output 70 [2022-12-13 18:05:31,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:05:31,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 43 [2022-12-13 18:05:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 18:05:33,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:05:36,910 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse0) 4) 8) (select |c_#length| (select (select .cse1 .cse0) 4))))))) is different from false [2022-12-13 18:05:36,944 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse0) 4)) (select |c_#length| (select (select .cse1 .cse0) 4)))))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))))) is different from false [2022-12-13 18:05:37,014 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse0) 4) 8) (select |c_#length| (select (select .cse1 .cse0) 4)))))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4)))) is different from false [2022-12-13 18:05:37,048 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4))))) is different from false [2022-12-13 18:05:37,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4))))) is different from false [2022-12-13 18:05:37,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10502))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10503) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))))))) is different from false [2022-12-13 18:05:37,227 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10503) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) 4))) (forall ((v_ArrVal_10503 (Array Int Int)) (v_ArrVal_10502 (Array Int Int)) (v_ArrVal_10501 (Array Int Int)) (v_ArrVal_10500 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10500) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10502))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10501) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_10503) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))))))) is different from false [2022-12-13 18:05:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430379021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:05:38,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:05:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 73 [2022-12-13 18:05:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340804509] [2022-12-13 18:05:38,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:05:38,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-13 18:05:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:05:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-13 18:05:38,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6211, Unknown=9, NotChecked=1320, Total=7832 [2022-12-13 18:05:38,404 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 74 states, 71 states have (on average 2.140845070422535) internal successors, (152), 65 states have internal predecessors, (152), 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-12-13 18:05:48,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse21 (select |c_#memory_$Pointer$.base| .cse19)) (.cse14 (select |c_#memory_$Pointer$.offset| .cse19)) (.cse41 (+ .cse7 4))) (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse31 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse36 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse34 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse37 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse38 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse39 (select .cse14 .cse41)) (.cse23 (select .cse21 .cse41)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse40))) (let ((.cse10 (select |c_#length| .cse19)) (.cse8 (select |c_#length| .cse12)) (.cse4 (not (= .cse23 .cse19))) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse40)) (.cse24 (<= 0 .cse7)) (.cse25 (<= 0 .cse39)) (.cse26 (<= (+ 12 .cse39) (select |c_#length| .cse23))) (.cse1 (select .cse37 .cse38)) (.cse15 (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (select .cse34 .cse38)) (.cse2 (select |c_#length| .cse5)) (.cse29 (select .cse31 .cse36)) (.cse9 (select .cse21 4)) (.cse33 (select |c_#length| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse32 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse13 (select .cse35 4)) (.cse30 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse27 (not (= .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse28 (<= .cse7 0)) (.cse11 (select .cse37 4)) (.cse3 (select .cse35 .cse36))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ 12 .cse0) (select |c_#length| .cse1)) (<= 12 .cse2) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= 0 .cse6) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse7 0) (<= (+ .cse6 12) .cse8) (not (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#length| .cse9) .cse10) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse11 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 12 .cse10) (not (= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse9) 1) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse14 4) 0) (= .cse15 .cse8) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| (Array Int (Array Int Int)))) (let ((.cse17 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (+ 4 .cse17))) (let ((.cse20 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_#memory_$Pointer$.offset|)) (.cse16 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse19) .cse22)) (.cse18 (select .cse21 .cse22))) (and (<= 0 .cse16) (<= .cse17 0) (not (= .cse18 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse18 .cse19)) (<= 0 .cse17) (not (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse20 (select |c_#memory_$Pointer$.offset| .cse20)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse20) (<= (+ .cse16 12) (select |c_#length| .cse18))))))) (and .cse4 (not (= .cse23 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) .cse24 .cse25 .cse26 .cse27 .cse28)) (<= (+ .cse29 12) (select |c_#length| .cse3)) (not (= .cse9 .cse19)) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse24 .cse25 (= (select |c_#valid| .cse23) 1) (= .cse30 12) (= .cse15 12) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse26 (= (select .cse31 4) 0) (= (select |c_#valid| .cse1) 1) (<= 12 .cse15) (not (= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse19)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (<= 0 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= .cse2 (select |c_#length| .cse32)) (<= 12 .cse33) (<= 0 .cse29) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)) (not (= .cse32 .cse5)) (= (select |c_#valid| .cse19) 1) (not (= .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse13) 1) (= (select |c_#length| .cse11) .cse33) (not (= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= .cse32 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#length| .cse13) .cse30) (<= 12 .cse30) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse27 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) .cse28 (= (select |c_#valid| .cse11) 1) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse3) 1) (= (select .cse34 4) 0)))))) is different from false [2022-12-13 18:05:48,983 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse21 (select |c_#memory_$Pointer$.base| .cse19)) (.cse14 (select |c_#memory_$Pointer$.offset| .cse19)) (.cse41 (+ .cse7 4))) (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse31 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse36 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse34 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse37 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse38 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse39 (select .cse14 .cse41)) (.cse23 (select .cse21 .cse41)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse40))) (let ((.cse10 (select |c_#length| .cse19)) (.cse8 (select |c_#length| .cse12)) (.cse4 (not (= .cse23 .cse19))) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse40)) (.cse24 (<= 0 .cse7)) (.cse25 (<= 0 .cse39)) (.cse26 (<= (+ 12 .cse39) (select |c_#length| .cse23))) (.cse1 (select .cse37 .cse38)) (.cse15 (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (select .cse34 .cse38)) (.cse2 (select |c_#length| .cse5)) (.cse29 (select .cse31 .cse36)) (.cse9 (select .cse21 4)) (.cse33 (select |c_#length| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse32 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse13 (select .cse35 4)) (.cse30 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse27 (not (= .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse28 (<= .cse7 0)) (.cse11 (select .cse37 4)) (.cse3 (select .cse35 .cse36))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ 12 .cse0) (select |c_#length| .cse1)) (<= 12 .cse2) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= 0 .cse6) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse7 0) (<= (+ .cse6 12) .cse8) (not (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#length| .cse9) .cse10) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse11 |c_ULTIMATE.start_dll_create_#res#1.base|)) (<= 12 .cse10) (not (= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse9) 1) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse14 4) 0) (= .cse15 .cse8) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| (Array Int (Array Int Int)))) (let ((.cse17 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (+ 4 .cse17))) (let ((.cse20 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| |c_#memory_$Pointer$.offset|)) (.cse16 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse19) .cse22)) (.cse18 (select .cse21 .cse22))) (and (<= 0 .cse16) (<= .cse17 0) (not (= .cse18 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse18 .cse19)) (<= 0 .cse17) (not (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_103| .cse20 (select |c_#memory_$Pointer$.offset| .cse20)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse20) (<= (+ .cse16 12) (select |c_#length| .cse18))))))) (and .cse4 (not (= .cse23 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) .cse24 .cse25 .cse26 .cse27 .cse28)) (<= (+ .cse29 12) (select |c_#length| .cse3)) (not (= .cse9 .cse19)) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse24 .cse25 (= (select |c_#valid| .cse23) 1) (= .cse30 12) (= .cse15 12) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse26 (= (select .cse31 4) 0) (= (select |c_#valid| .cse1) 1) (<= 12 .cse15) (not (= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse19)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (<= 0 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= .cse2 (select |c_#length| .cse32)) (<= 12 .cse33) (<= 0 .cse29) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)) (not (= .cse32 .cse5)) (= (select |c_#valid| .cse19) 1) (not (= .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse13) 1) (= (select |c_#length| .cse11) .cse33) (not (= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= .cse32 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#length| .cse13) .cse30) (<= 12 .cse30) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse27 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) .cse28 (= (select |c_#valid| .cse11) 1) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse3) 1) (= (select .cse34 4) 0)))))) is different from true [2022-12-13 18:06:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:06:04,516 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-12-13 18:06:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 18:06:04,517 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 71 states have (on average 2.140845070422535) internal successors, (152), 65 states have internal predecessors, (152), 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 90 [2022-12-13 18:06:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:06:04,517 INFO L225 Difference]: With dead ends: 95 [2022-12-13 18:06:04,517 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 18:06:04,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=742, Invalid=11055, Unknown=11, NotChecked=1998, Total=13806 [2022-12-13 18:06:04,518 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 380 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 2734 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:06:04,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 907 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2734 Invalid, 0 Unknown, 83 Unchecked, 9.5s Time] [2022-12-13 18:06:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 18:06:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-12-13 18:06:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.075) internal successors, (86), 84 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-12-13 18:06:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-12-13 18:06:04,520 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 90 [2022-12-13 18:06:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:06:04,521 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-12-13 18:06:04,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 71 states have (on average 2.140845070422535) internal successors, (152), 65 states have internal predecessors, (152), 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-12-13 18:06:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-12-13 18:06:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 18:06:04,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:06:04,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:06:04,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-13 18:06:04,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 18:06:04,723 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:06:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:06:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1844729625, now seen corresponding path program 1 times [2022-12-13 18:06:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:06:04,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775360464] [2022-12-13 18:06:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:06:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:06:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:06:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:06:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:06:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:06:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:06:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:06:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:06:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 18:06:15,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:06:15,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775360464] [2022-12-13 18:06:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775360464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:06:15,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76279780] [2022-12-13 18:06:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:06:15,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:06:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:06:15,658 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:06:15,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 18:06:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:06:16,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-13 18:06:16,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:06:16,486 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-12-13 18:06:19,201 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 18 treesize of output 10 [2022-12-13 18:06:19,212 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-12-13 18:06:21,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:06:21,263 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-12-13 18:06:21,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:06:21,329 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 24 treesize of output 24 [2022-12-13 18:06:21,378 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:06:21,379 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-12-13 18:06:26,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:06:26,915 INFO L321 Elim1Store]: treesize reduction 72, result has 38.5 percent of original size [2022-12-13 18:06:26,915 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 96 [2022-12-13 18:06:27,085 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-12-13 18:06:27,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 141 [2022-12-13 18:06:27,219 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 37 treesize of output 31 [2022-12-13 18:06:27,244 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 37 treesize of output 31 [2022-12-13 18:06:27,272 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:06:27,272 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2022-12-13 18:06:27,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:06:27,822 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:06:27,822 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 80 treesize of output 76 [2022-12-13 18:06:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:06:27,851 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 18:06:27,851 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 64 treesize of output 65 [2022-12-13 18:06:31,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:06:31,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 200 [2022-12-13 18:06:32,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:06:32,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 167 treesize of output 257 [2022-12-13 18:06:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 18:06:48,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:06:51,294 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10800 (Array Int Int)) (v_ArrVal_10799 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10800))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10799) .cse0) 4) 0)) (not (= (select (select .cse1 .cse0) 4) 0)) (not (< .cse0 |c_#StackHeapBarrier|)))))) is different from false [2022-12-13 18:06:58,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76279780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:06:58,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:06:58,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 34] total 76 [2022-12-13 18:06:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105531160] [2022-12-13 18:06:58,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:06:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-13 18:06:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:06:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-13 18:06:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=8185, Unknown=38, NotChecked=182, Total=8742 [2022-12-13 18:06:58,741 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 69 states have internal predecessors, (157), 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-12-13 18:07:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:07:32,408 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-12-13 18:07:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 18:07:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 69 states have internal predecessors, (157), 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 91 [2022-12-13 18:07:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:07:32,409 INFO L225 Difference]: With dead ends: 89 [2022-12-13 18:07:32,409 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 18:07:32,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3706 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=1263, Invalid=15995, Unknown=38, NotChecked=260, Total=17556 [2022-12-13 18:07:32,411 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 551 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:07:32,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 768 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-12-13 18:07:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 18:07:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-13 18:07:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.0625) internal successors, (85), 84 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-12-13 18:07:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-12-13 18:07:32,413 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 91 [2022-12-13 18:07:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:07:32,413 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-12-13 18:07:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 69 states have internal predecessors, (157), 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-12-13 18:07:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-12-13 18:07:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 18:07:32,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:07:32,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:07:32,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-13 18:07:32,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 18:07:32,615 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-12-13 18:07:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:07:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1037773800, now seen corresponding path program 1 times [2022-12-13 18:07:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:07:32,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681370299] [2022-12-13 18:07:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:07:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:07:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:07:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:07:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:07:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:07:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:07:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:07:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:07:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 18:07:39,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:07:39,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681370299] [2022-12-13 18:07:39,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681370299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:07:39,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469614907] [2022-12-13 18:07:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:07:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:07:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:07:39,130 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:07:39,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b36e3ef-02cd-48f0-9868-128decdbdcbb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 18:07:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:07:39,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 158 conjunts are in the unsatisfiable core [2022-12-13 18:07:39,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:07:39,588 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-12-13 18:07:39,603 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-12-13 18:07:39,893 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-12-13 18:07:39,903 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-12-13 18:07:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:40,717 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-12-13 18:07:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:40,740 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-12-13 18:07:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:41,869 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-12-13 18:07:41,876 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-12-13 18:07:42,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:07:42,685 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-12-13 18:07:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:42,846 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 18:07:42,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 18:07:43,734 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-12-13 18:07:44,282 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:07:44,282 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 1 case distinctions, treesize of input 43 treesize of output 42 [2022-12-13 18:07:46,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:07:46,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-12-13 18:07:46,080 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-12-13 18:07:46,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:46,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-12-13 18:07:46,102 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-12-13 18:07:48,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:48,147 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-12-13 18:07:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:48,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 18:07:48,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:48,243 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:07:48,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-12-13 18:07:48,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:48,363 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 18:07:48,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 18:07:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:51,860 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 13 treesize of output 9 [2022-12-13 18:07:52,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:52,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:07:53,176 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2022-12-13 18:07:53,176 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 165 treesize of output 88 [2022-12-13 18:07:53,263 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:07:53,264 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 31 [2022-12-13 18:07:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:53,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 18:07:53,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:07:53,739 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:07:53,739 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 70 treesize of output 58