./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R --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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- 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-38b53e6 [2022-11-25 18:35:58,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:35:58,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:35:58,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:35:58,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:35:58,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:35:58,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:35:58,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:35:58,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:35:58,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:35:58,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:35:58,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:35:58,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:35:58,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:35:58,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:35:58,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:35:58,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:35:58,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:35:58,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:35:58,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:35:58,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:35:58,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:35:58,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:35:58,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:35:58,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:35:58,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:35:58,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:35:58,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:35:58,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:35:58,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:35:58,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:35:58,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:35:58,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:35:58,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:35:58,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:35:58,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:35:58,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:35:58,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:35:58,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:35:58,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:35:58,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:35:58,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:35:58,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:35:58,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:35:58,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:35:58,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:35:58,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:35:58,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:35:58,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:35:58,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:35:58,232 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:35:58,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:35:58,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:35:58,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:35:58,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:35:58,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:35:58,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:35:58,235 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:35:58,235 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:35:58,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:35:58,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:35:58,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:35:58,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:35:58,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:35:58,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:35:58,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:35:58,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:35:58,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:35:58,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:35:58,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:35:58,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:35:58,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:35:58,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:35:58,240 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:35:58,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:35:58,240 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_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/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_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2022-11-25 18:35:58,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:35:58,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:35:58,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:35:58,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:35:58,651 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:35:58,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-11-25 18:36:01,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:36:02,112 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:36:02,112 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-11-25 18:36:02,126 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/data/0dbde391c/d6ea48b9a13743659041dade8221dc64/FLAGfa75d0a0e [2022-11-25 18:36:02,157 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/data/0dbde391c/d6ea48b9a13743659041dade8221dc64 [2022-11-25 18:36:02,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:36:02,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:36:02,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:36:02,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:36:02,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:36:02,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e0a632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02, skipping insertion in model container [2022-11-25 18:36:02,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:36:02,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:36:02,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:36:02,616 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:36:02,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:36:02,717 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:36:02,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02 WrapperNode [2022-11-25 18:36:02,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:36:02,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:36:02,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:36:02,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:36:02,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,771 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-11-25 18:36:02,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:36:02,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:36:02,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:36:02,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:36:02,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:36:02,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:36:02,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:36:02,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:36:02,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (1/1) ... [2022-11-25 18:36:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:36:02,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:02,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:36:02,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:36:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:36:02,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:36:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:36:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:36:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:36:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:36:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:36:02,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:36:03,001 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:36:03,003 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:36:03,246 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:36:03,254 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:36:03,254 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:36:03,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:36:03 BoogieIcfgContainer [2022-11-25 18:36:03,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:36:03,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:36:03,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:36:03,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:36:03,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:36:02" (1/3) ... [2022-11-25 18:36:03,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da070b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:36:03, skipping insertion in model container [2022-11-25 18:36:03,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:02" (2/3) ... [2022-11-25 18:36:03,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da070b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:36:03, skipping insertion in model container [2022-11-25 18:36:03,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:36:03" (3/3) ... [2022-11-25 18:36:03,267 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-11-25 18:36:03,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:36:03,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-25 18:36:03,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:36:03,346 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;@446aff0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:36:03,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-25 18:36:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:36:03,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:03,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:36:03,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 18:36:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:03,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40346065] [2022-11-25 18:36:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40346065] [2022-11-25 18:36:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40346065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:03,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:03,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:36:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856493219] [2022-11-25 18:36:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:03,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:36:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:36:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:36:03,752 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:03,912 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-25 18:36:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:36:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 18:36:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:03,924 INFO L225 Difference]: With dead ends: 63 [2022-11-25 18:36:03,925 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 18:36:03,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:36:03,930 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:03,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 18:36:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-11-25 18:36:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-25 18:36:03,966 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-11-25 18:36:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:03,967 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-25 18:36:03,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-25 18:36:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:36:03,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:03,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:36:03,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:36:03,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 18:36:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429333208] [2022-11-25 18:36:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:04,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429333208] [2022-11-25 18:36:04,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429333208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:04,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:04,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:36:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413362250] [2022-11-25 18:36:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:04,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:36:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:36:04,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:36:04,063 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:04,129 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-25 18:36:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:36:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 18:36:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:04,130 INFO L225 Difference]: With dead ends: 55 [2022-11-25 18:36:04,130 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 18:36:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:36:04,132 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:04,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 18:36:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-11-25 18:36:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 18:36:04,138 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-11-25 18:36:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:04,139 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 18:36:04,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 18:36:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:36:04,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:04,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:36:04,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-11-25 18:36:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846766563] [2022-11-25 18:36:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:04,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846766563] [2022-11-25 18:36:04,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846766563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:04,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:04,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:36:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765036199] [2022-11-25 18:36:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:04,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:36:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:36:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:04,301 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:04,443 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-11-25 18:36:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:36:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 18:36:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:04,445 INFO L225 Difference]: With dead ends: 58 [2022-11-25 18:36:04,445 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 18:36:04,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:36:04,446 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:04,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 18:36:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-11-25 18:36:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-11-25 18:36:04,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-11-25 18:36:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:04,465 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-11-25 18:36:04,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-11-25 18:36:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:36:04,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:04,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:04,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:36:04,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-11-25 18:36:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:04,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385451583] [2022-11-25 18:36:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:04,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385451583] [2022-11-25 18:36:04,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385451583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:04,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:04,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:36:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330543400] [2022-11-25 18:36:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:04,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:36:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:36:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:04,774 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:04,891 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-11-25 18:36:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:36:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 18:36:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:04,892 INFO L225 Difference]: With dead ends: 87 [2022-11-25 18:36:04,892 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 18:36:04,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:36:04,894 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:04,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 18:36:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-11-25 18:36:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-11-25 18:36:04,902 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-11-25 18:36:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:04,902 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-11-25 18:36:04,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-11-25 18:36:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 18:36:04,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:04,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:04,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:36:04,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-11-25 18:36:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:04,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867850718] [2022-11-25 18:36:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:04,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:04,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867850718] [2022-11-25 18:36:04,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867850718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:04,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:04,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:36:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45965653] [2022-11-25 18:36:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:04,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:36:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:36:04,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:04,967 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:05,040 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-11-25 18:36:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:36:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 18:36:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:05,041 INFO L225 Difference]: With dead ends: 90 [2022-11-25 18:36:05,041 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 18:36:05,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:36:05,043 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:05,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 58 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 18:36:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-11-25 18:36:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-11-25 18:36:05,050 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-11-25 18:36:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:05,050 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-11-25 18:36:05,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-11-25 18:36:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:36:05,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:05,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:05,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:36:05,052 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-11-25 18:36:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:05,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350465079] [2022-11-25 18:36:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350465079] [2022-11-25 18:36:05,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350465079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:05,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:05,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:36:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182968218] [2022-11-25 18:36:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:05,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:36:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:36:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:05,270 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:05,322 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-11-25 18:36:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:36:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:36:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:05,323 INFO L225 Difference]: With dead ends: 66 [2022-11-25 18:36:05,323 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:36:05,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:05,325 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:05,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:36:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:36:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:36:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-25 18:36:05,330 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-11-25 18:36:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:05,331 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-25 18:36:05,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-25 18:36:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:36:05,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:05,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:05,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:36:05,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-11-25 18:36:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:05,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409551936] [2022-11-25 18:36:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:05,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409551936] [2022-11-25 18:36:05,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409551936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:05,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:05,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:36:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338785346] [2022-11-25 18:36:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:05,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:36:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:05,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:36:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:36:05,802 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:05,999 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-11-25 18:36:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:36:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 18:36:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:06,001 INFO L225 Difference]: With dead ends: 73 [2022-11-25 18:36:06,001 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:36:06,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:36:06,003 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:06,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:36:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-11-25 18:36:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-11-25 18:36:06,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-11-25 18:36:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:06,016 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-11-25 18:36:06,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-11-25 18:36:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:36:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:06,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:06,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:36:06,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-11-25 18:36:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:06,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485873123] [2022-11-25 18:36:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:06,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485873123] [2022-11-25 18:36:06,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485873123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:06,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:06,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:36:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460427488] [2022-11-25 18:36:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:06,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:36:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:36:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:36:06,156 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:06,263 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-25 18:36:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:36:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 18:36:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:06,267 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:36:06,267 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 18:36:06,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:36:06,269 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:06,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 18:36:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-11-25 18:36:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-11-25 18:36:06,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-11-25 18:36:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-11-25 18:36:06,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-11-25 18:36:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:36:06,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:06,291 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:06,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:36:06,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-11-25 18:36:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:06,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338949230] [2022-11-25 18:36:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:06,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338949230] [2022-11-25 18:36:06,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338949230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:06,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701490726] [2022-11-25 18:36:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:06,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:06,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:06,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:36:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:06,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:36:06,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:06,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:06,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:07,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:07,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:36:07,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:07,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:36:07,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:07,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:36:07,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:07,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:36:07,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:07,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:36:07,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:07,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:07,206 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 15 treesize of output 10 [2022-11-25 18:36:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:07,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:07,680 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 10 treesize of output 8 [2022-11-25 18:36:07,688 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 14 treesize of output 12 [2022-11-25 18:36:07,700 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 10 treesize of output 8 [2022-11-25 18:36:07,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:07,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701490726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:07,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:07,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-25 18:36:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510158233] [2022-11-25 18:36:07,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:36:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:36:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:36:07,726 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:08,188 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-11-25 18:36:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:36:08,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:36:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:08,191 INFO L225 Difference]: With dead ends: 85 [2022-11-25 18:36:08,191 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 18:36:08,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:36:08,192 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:08,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 203 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:36:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 18:36:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-11-25 18:36:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-11-25 18:36:08,199 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-11-25 18:36:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:08,200 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-11-25 18:36:08,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-11-25 18:36:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:36:08,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:08,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:08,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:08,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-11-25 18:36:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676832408] [2022-11-25 18:36:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676832408] [2022-11-25 18:36:08,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676832408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868665307] [2022-11-25 18:36:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:08,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:08,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:36:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:08,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:36:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:08,732 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 13 treesize of output 9 [2022-11-25 18:36:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:08,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:08,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868665307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:08,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:08,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 18:36:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444368485] [2022-11-25 18:36:08,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:08,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:36:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:36:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:36:08,807 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:08,918 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-11-25 18:36:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:36:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 18:36:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:08,925 INFO L225 Difference]: With dead ends: 83 [2022-11-25 18:36:08,925 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:36:08,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:36:08,927 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:08,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:36:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 18:36:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-11-25 18:36:08,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-11-25 18:36:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:08,938 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-11-25 18:36:08,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-11-25 18:36:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:36:08,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:08,946 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:08,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:09,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:36:09,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-11-25 18:36:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:09,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891550566] [2022-11-25 18:36:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:09,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891550566] [2022-11-25 18:36:09,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891550566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:09,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:09,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:36:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251327608] [2022-11-25 18:36:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:09,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:36:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:36:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:36:09,289 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:09,395 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-11-25 18:36:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:36:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 18:36:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:09,396 INFO L225 Difference]: With dead ends: 81 [2022-11-25 18:36:09,396 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 18:36:09,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:36:09,398 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:09,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 51 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 18:36:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-11-25 18:36:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-11-25 18:36:09,402 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-11-25 18:36:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:09,402 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-11-25 18:36:09,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-11-25 18:36:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:36:09,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:09,403 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:09,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:36:09,404 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-11-25 18:36:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:09,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608782076] [2022-11-25 18:36:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:09,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608782076] [2022-11-25 18:36:09,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608782076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:09,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:09,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:36:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669402919] [2022-11-25 18:36:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:09,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:36:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:36:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:36:09,742 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:09,988 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-11-25 18:36:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:36:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 18:36:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:09,990 INFO L225 Difference]: With dead ends: 87 [2022-11-25 18:36:09,990 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 18:36:09,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:36:09,990 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:09,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:36:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 18:36:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-11-25 18:36:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-25 18:36:09,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-11-25 18:36:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:09,994 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-25 18:36:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-25 18:36:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:36:09,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:09,996 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:09,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:36:09,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-11-25 18:36:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339145150] [2022-11-25 18:36:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339145150] [2022-11-25 18:36:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339145150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:10,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:10,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:36:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802116752] [2022-11-25 18:36:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:10,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:36:10,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:10,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:36:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:36:10,457 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:10,693 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-25 18:36:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:36:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 18:36:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:10,694 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:36:10,694 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 18:36:10,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:36:10,695 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:36:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 18:36:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-11-25 18:36:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-25 18:36:10,698 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-11-25 18:36:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:10,698 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-25 18:36:10,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-25 18:36:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:36:10,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:10,699 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:10,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:36:10,699 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-11-25 18:36:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:10,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61213457] [2022-11-25 18:36:10,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61213457] [2022-11-25 18:36:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61213457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:11,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:11,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:36:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111133324] [2022-11-25 18:36:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:11,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:36:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:36:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:36:11,031 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:11,249 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-25 18:36:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:36:11,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:36:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:11,250 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:36:11,250 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 18:36:11,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:36:11,251 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:11,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:36:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 18:36:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-11-25 18:36:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-11-25 18:36:11,253 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-11-25 18:36:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:11,254 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-11-25 18:36:11,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-11-25 18:36:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:36:11,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:11,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:11,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:36:11,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-11-25 18:36:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:11,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463384467] [2022-11-25 18:36:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:11,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463384467] [2022-11-25 18:36:11,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463384467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:11,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828824161] [2022-11-25 18:36:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:11,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:11,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:11,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:11,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:36:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:11,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 18:36:11,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:11,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:36:11,792 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:36:11,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:36:11,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:11,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:11,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 18:36:11,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:11,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 18:36:12,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:12,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:12,032 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 25 treesize of output 16 [2022-11-25 18:36:12,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:36:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:12,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:12,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:12,599 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 49 treesize of output 53 [2022-11-25 18:36:12,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:12,833 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 18 treesize of output 19 [2022-11-25 18:36:12,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:12,856 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 30 treesize of output 30 [2022-11-25 18:36:12,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 18:36:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:12,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828824161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:12,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:12,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22 [2022-11-25 18:36:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138223859] [2022-11-25 18:36:12,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:12,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:36:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:36:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=439, Unknown=3, NotChecked=0, Total=506 [2022-11-25 18:36:12,999 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:14,427 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-11-25 18:36:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:36:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:36:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:14,429 INFO L225 Difference]: With dead ends: 95 [2022-11-25 18:36:14,429 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 18:36:14,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=940, Unknown=3, NotChecked=0, Total=1190 [2022-11-25 18:36:14,430 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:14,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 176 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:36:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 18:36:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2022-11-25 18:36:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-25 18:36:14,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-11-25 18:36:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:14,433 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-25 18:36:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-25 18:36:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:36:14,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:14,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:14,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:14,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:14,641 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-11-25 18:36:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754904189] [2022-11-25 18:36:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:15,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:15,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754904189] [2022-11-25 18:36:15,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754904189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:15,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975737389] [2022-11-25 18:36:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:15,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:15,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:36:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:15,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:36:15,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:15,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-11-25 18:36:15,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:36:15,442 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:36:15,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:36:15,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:36:15,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:15,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:15,543 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:15,544 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 38 treesize of output 37 [2022-11-25 18:36:15,551 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 18 treesize of output 20 [2022-11-25 18:36:15,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:36:15,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:15,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 18:36:15,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:15,732 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 18:36:15,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:15,739 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:36:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:15,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:16,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:16,386 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 18 treesize of output 19 [2022-11-25 18:36:16,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:16,403 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 30 treesize of output 30 [2022-11-25 18:36:16,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 18:36:16,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:16,448 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 37 treesize of output 38 [2022-11-25 18:36:16,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:16,459 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 29 treesize of output 30 [2022-11-25 18:36:16,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:16,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:16,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-25 18:36:16,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:16,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:16,477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-25 18:36:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:16,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975737389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:16,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:16,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-11-25 18:36:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405441841] [2022-11-25 18:36:16,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:16,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:36:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:36:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=439, Unknown=1, NotChecked=0, Total=506 [2022-11-25 18:36:16,828 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:17,999 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-11-25 18:36:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:36:18,000 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:36:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:18,001 INFO L225 Difference]: With dead ends: 111 [2022-11-25 18:36:18,001 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 18:36:18,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=934, Unknown=1, NotChecked=0, Total=1190 [2022-11-25 18:36:18,003 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:18,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 164 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:36:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 18:36:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2022-11-25 18:36:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-11-25 18:36:18,009 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2022-11-25 18:36:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:18,010 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-11-25 18:36:18,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-11-25 18:36:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:36:18,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:18,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:18,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:18,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:36:18,219 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-11-25 18:36:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:18,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622253380] [2022-11-25 18:36:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622253380] [2022-11-25 18:36:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622253380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144387229] [2022-11-25 18:36:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:18,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:18,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:18,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:36:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:18,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:36:18,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:18,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:36:18,683 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:36:18,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:36:18,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:18,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:18,751 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 27 treesize of output 28 [2022-11-25 18:36:18,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:18,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 18:36:18,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:18,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:18,874 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 24 treesize of output 15 [2022-11-25 18:36:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:18,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:19,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:19,147 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 19 treesize of output 20 [2022-11-25 18:36:19,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:19,159 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 33 treesize of output 33 [2022-11-25 18:36:19,166 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 20 treesize of output 18 [2022-11-25 18:36:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:19,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144387229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:19,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:19,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-11-25 18:36:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679854593] [2022-11-25 18:36:19,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:19,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 18:36:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:19,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 18:36:19,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=352, Unknown=6, NotChecked=0, Total=420 [2022-11-25 18:36:19,360 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:20,254 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-11-25 18:36:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:36:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:36:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:20,255 INFO L225 Difference]: With dead ends: 110 [2022-11-25 18:36:20,255 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 18:36:20,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=807, Unknown=6, NotChecked=0, Total=1056 [2022-11-25 18:36:20,257 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 227 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:20,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 184 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:36:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 18:36:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2022-11-25 18:36:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-11-25 18:36:20,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 27 [2022-11-25 18:36:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:20,260 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-11-25 18:36:20,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-11-25 18:36:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 18:36:20,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:20,261 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:20,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:20,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:36:20,462 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-11-25 18:36:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360521909] [2022-11-25 18:36:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:20,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360521909] [2022-11-25 18:36:20,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360521909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:36:20,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:36:20,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:36:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566675633] [2022-11-25 18:36:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:36:20,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:36:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:36:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:36:20,855 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:21,169 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-11-25 18:36:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:36:21,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 18:36:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:21,171 INFO L225 Difference]: With dead ends: 98 [2022-11-25 18:36:21,171 INFO L226 Difference]: Without dead ends: 98 [2022-11-25 18:36:21,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:36:21,172 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:21,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 109 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:36:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-25 18:36:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-11-25 18:36:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2022-11-25 18:36:21,175 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 29 [2022-11-25 18:36:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:21,175 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2022-11-25 18:36:21,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2022-11-25 18:36:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:36:21,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:21,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:21,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:36:21,177 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:36:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-11-25 18:36:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:36:21,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313958484] [2022-11-25 18:36:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:36:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:36:22,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313958484] [2022-11-25 18:36:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313958484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:22,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179827521] [2022-11-25 18:36:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:22,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:36:22,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:36:22,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:36:22,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:36:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:22,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 18:36:22,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:22,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:36:22,326 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:36:22,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:36:22,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:36:22,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:22,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 18:36:22,394 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:36:22,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 18:36:22,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:22,411 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 39 treesize of output 30 [2022-11-25 18:36:22,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:22,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:22,790 INFO L321 Elim1Store]: treesize reduction 10, result has 68.8 percent of original size [2022-11-25 18:36:22,791 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 41 [2022-11-25 18:36:22,936 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:36:22,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 18:36:22,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-11-25 18:36:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:22,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:24,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:24,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 465 [2022-11-25 18:36:26,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse7 (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))))) (and (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse0 v_prenex_4) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|)) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4))) (let ((.cse4 (select .cse3 v_prenex_5))) (or (not (= (select .cse3 8) .cse4)) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse4 v_prenex_4) (not (<= 0 v_prenex_5)))))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse5 v_prenex_4) (not (<= 0 v_prenex_5)) (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_5)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse6 v_prenex_4) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (or .cse7 (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse9 v_prenex_4)))))) (or .cse7 (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (= .cse10 v_prenex_4) (= .cse10 |c_ULTIMATE.start_main_~list~0#1.base|))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse11 v_prenex_4) (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse12 v_prenex_4) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|))))))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse13 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse14 v_prenex_4) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= .cse14 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) is different from false [2022-11-25 18:36:26,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:26,516 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-11-25 18:36:26,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-11-25 18:36:26,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:26,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:36:26,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2022-11-25 18:36:26,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:26,581 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 20 treesize of output 18 [2022-11-25 18:36:26,594 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 26 treesize of output 24 [2022-11-25 18:36:26,678 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,679 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-25 18:36:26,688 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,689 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,699 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,699 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-25 18:36:26,709 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,720 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,721 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2022-11-25 18:36:26,731 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,731 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,741 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,742 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-25 18:36:26,752 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,752 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,762 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,772 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,772 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,782 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,783 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2022-11-25 18:36:26,793 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,793 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,801 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,801 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 18:36:26,809 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,809 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2022-11-25 18:36:26,817 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,818 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2022-11-25 18:36:26,828 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:36:26,828 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-25 18:36:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:36:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179827521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:36:26,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:36:26,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-11-25 18:36:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440275436] [2022-11-25 18:36:26,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 18:36:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 18:36:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2022-11-25 18:36:26,946 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:36:50,116 WARN L233 SmtUtils]: Spent 22.58s on a formula simplification. DAG size of input: 126 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:37:07,314 WARN L233 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 137 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:37:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:37:08,989 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-11-25 18:37:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:37:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 18:37:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:37:08,990 INFO L225 Difference]: With dead ends: 96 [2022-11-25 18:37:08,991 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 18:37:08,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=690, Invalid=2971, Unknown=3, NotChecked=118, Total=3782 [2022-11-25 18:37:08,993 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 254 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 73 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:37:08,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 232 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 627 Invalid, 6 Unknown, 61 Unchecked, 1.0s Time] [2022-11-25 18:37:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 18:37:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-11-25 18:37:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:37:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-11-25 18:37:08,996 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-11-25 18:37:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:37:08,996 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-11-25 18:37:08,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:37:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-11-25 18:37:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:37:08,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:37:08,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:37:09,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:37:09,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:37:09,198 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:37:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:37:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-11-25 18:37:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:37:09,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466062823] [2022-11-25 18:37:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:37:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:37:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:37:10,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466062823] [2022-11-25 18:37:10,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466062823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:37:10,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198955027] [2022-11-25 18:37:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:37:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:37:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:37:10,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:37:10,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:37:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:10,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 18:37:10,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:37:10,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:37:10,657 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 15 treesize of output 11 [2022-11-25 18:37:10,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:37:10,721 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:37:10,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:37:10,796 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 19 treesize of output 18 [2022-11-25 18:37:10,809 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 19 treesize of output 18 [2022-11-25 18:37:10,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:10,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:10,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:37:10,899 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 1 case distinctions, treesize of input 85 treesize of output 62 [2022-11-25 18:37:10,928 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 18:37:10,928 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 44 treesize of output 41 [2022-11-25 18:37:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:11,055 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-25 18:37:11,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:11,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:11,082 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:37:11,082 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 59 treesize of output 48 [2022-11-25 18:37:12,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:12,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:12,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:37:12,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:12,029 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:37:12,030 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 34 [2022-11-25 18:37:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:37:12,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:37:33,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:33,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:33,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:33,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:33,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:37:33,722 INFO L321 Elim1Store]: treesize reduction 206, result has 50.8 percent of original size [2022-11-25 18:37:33,723 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 3377 treesize of output 1894 [2022-11-25 18:37:33,959 INFO L321 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-11-25 18:37:33,960 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 52216 treesize of output 13123 [2022-11-25 18:37:34,400 INFO L321 Elim1Store]: treesize reduction 19, result has 51.3 percent of original size [2022-11-25 18:37:34,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11732 treesize of output 10826 [2022-11-25 18:37:34,610 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 18:37:34,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 10779 treesize of output 9873 [2022-11-25 18:37:34,816 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 13 treesize of output 4 [2022-11-25 18:37:34,898 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 13 treesize of output 4 [2022-11-25 18:39:28,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:39:28,599 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-11-25 18:39:28,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 248 treesize of output 232 [2022-11-25 18:39:28,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:39:28,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-25 18:39:28,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:28,793 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-25 18:39:28,794 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 722 treesize of output 1 [2022-11-25 18:39:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:39:29,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198955027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:29,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:39:29,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 39 [2022-11-25 18:39:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993294724] [2022-11-25 18:39:29,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:29,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:39:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:39:29,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:39:29,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1334, Unknown=3, NotChecked=0, Total=1482 [2022-11-25 18:39:29,081 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:39:48,074 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:39:51,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse13 .cse9 |c_ULTIMATE.start_main_~y~0#1.offset|))) (.cse22 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse26 (select .cse8 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse26)) (.cse16 (select .cse22 |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse15 (select .cse8 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse11 (select .cse6 |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (exists ((|ULTIMATE.start_main_~list~0#1.offset| Int) (|ULTIMATE.start_main_~list~0#1.base| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse1 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse0 4) 0) (= (select .cse1 |ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|) (not (= .cse2 |ULTIMATE.start_main_~list~0#1.base|)) (= 12 (select .cse0 8)) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse2) 8)) (<= 0 |ULTIMATE.start_main_~list~0#1.offset|) (<= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| (select .cse3 |ULTIMATE.start_main_~list~0#1.offset|)) (= (select .cse3 0) 0)))))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_38| Int) (v_ArrVal_917 Int) (v_ArrVal_915 Int) (v_ArrVal_911 Int)) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_917))) (let ((.cse4 (select .cse7 |v_ULTIMATE.start_main_~list~0#1.offset_38|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~y~0#1.base| .cse7) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse8 .cse9 v_ArrVal_911)) |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 v_ArrVal_915) |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (+ 8 .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (not (<= 0 .cse4)) (= .cse5 (+ 12 .cse4)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_38| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse5 0)))))) (= (select .cse12 4) 0) (= (select .cse13 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select .cse12 8) 12) (= (select .cse14 |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= 12 (select (select |c_#memory_$Pointer$.offset| .cse15) 8)) (= (select (select |c_#memory_$Pointer$.offset| .cse16) 8) 12) (= .cse16 (select (select |c_#memory_$Pointer$.base| .cse16) 8)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_38| Int) (v_ArrVal_917 Int) (v_ArrVal_915 Int)) (let ((.cse17 (store .cse14 .cse10 v_ArrVal_917))) (let ((.cse21 (select .cse17 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (.cse20 (store .cse22 .cse10 v_ArrVal_915))) (let ((.cse18 (select .cse20 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (.cse19 (+ .cse21 8))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| .cse17) .cse18) .cse19) 0) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_38| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| .cse20) .cse18) .cse19)) (not (<= 0 .cse21))))))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse15) 8) .cse15) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_38| Int) (v_ArrVal_917 Int) (v_ArrVal_915 Int)) (let ((.cse25 (store .cse14 .cse10 v_ArrVal_917))) (let ((.cse24 (select .cse25 |v_ULTIMATE.start_main_~list~0#1.offset_38|))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| .cse25) (select (store .cse22 .cse10 v_ArrVal_915) |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (+ .cse24 8)))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (= .cse23 0) (= (+ .cse24 12) .cse23) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_38| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 .cse24))))))) (= (select .cse13 0) 0) (not (= .cse26 |c_ULTIMATE.start_main_~list~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_38| Int) (v_ArrVal_917 Int) (v_ArrVal_915 Int) (v_ArrVal_911 Int)) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse8 .cse9 v_ArrVal_911))) (.cse32 (store .cse11 .cse10 v_ArrVal_917))) (let ((.cse27 (select .cse32 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (.cse30 (store (select .cse29 |c_ULTIMATE.start_main_~y~0#1.base|) .cse10 v_ArrVal_915))) (let ((.cse28 (select .cse30 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (.cse31 (+ 8 .cse27))) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_38|)) (not (<= 0 .cse27)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_38| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~y~0#1.base| .cse30) .cse28) .cse31)) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~y~0#1.base| .cse32) .cse28) .cse31) 0)))))) (= (select (select |c_#memory_$Pointer$.base| .cse26) 8) .cse26))))) is different from false [2022-11-25 18:39:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:56,400 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2022-11-25 18:39:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 18:39:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 18:39:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:56,401 INFO L225 Difference]: With dead ends: 145 [2022-11-25 18:39:56,402 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 18:39:56,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=661, Invalid=3759, Unknown=6, NotChecked=130, Total=4556 [2022-11-25 18:39:56,405 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 293 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:56,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 404 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 979 Invalid, 0 Unknown, 1 Unchecked, 4.2s Time] [2022-11-25 18:39:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 18:39:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2022-11-25 18:39:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:39:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-11-25 18:39:56,410 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 31 [2022-11-25 18:39:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:56,411 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-11-25 18:39:56,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:39:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-11-25 18:39:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:39:56,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:56,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:56,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 18:39:56,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:39:56,619 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:39:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 678570018, now seen corresponding path program 1 times [2022-11-25 18:39:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:39:56,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69418491] [2022-11-25 18:39:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:39:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:39:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:39:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69418491] [2022-11-25 18:39:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69418491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:39:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648906241] [2022-11-25 18:39:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:57,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:39:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:39:57,091 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:39:57,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:39:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:57,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:39:57,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:57,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-11-25 18:39:57,351 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:39:57,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:39:57,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:39:57,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:39:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:39:57,606 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 49 treesize of output 40 [2022-11-25 18:39:57,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:39:57,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:57,797 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 43 treesize of output 30 [2022-11-25 18:39:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:39:57,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:58,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_43| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_43|) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_43|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_43| |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-11-25 18:39:58,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:58,298 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 18 treesize of output 19 [2022-11-25 18:39:58,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:39:58,313 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 30 treesize of output 30 [2022-11-25 18:39:58,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 18:39:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:39:58,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648906241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:58,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:39:58,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-11-25 18:39:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801459503] [2022-11-25 18:39:58,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:58,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 18:39:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:39:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 18:39:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-25 18:39:58,576 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:40:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:40:00,528 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-11-25 18:40:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:40:00,528 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 18:40:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:40:00,530 INFO L225 Difference]: With dead ends: 134 [2022-11-25 18:40:00,530 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 18:40:00,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=239, Invalid=756, Unknown=1, NotChecked=60, Total=1056 [2022-11-25 18:40:00,532 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 155 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:40:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 175 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 403 Invalid, 0 Unknown, 63 Unchecked, 0.8s Time] [2022-11-25 18:40:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 18:40:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2022-11-25 18:40:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:40:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2022-11-25 18:40:00,537 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 31 [2022-11-25 18:40:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:40:00,537 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2022-11-25 18:40:00,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:40:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-11-25 18:40:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 18:40:00,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:40:00,539 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:40:00,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:40:00,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:40:00,746 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:40:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:40:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1131545711, now seen corresponding path program 2 times [2022-11-25 18:40:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:40:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576148390] [2022-11-25 18:40:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:40:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:40:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:40:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:40:02,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:40:02,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576148390] [2022-11-25 18:40:02,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576148390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:40:02,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575788561] [2022-11-25 18:40:02,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:40:02,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:40:02,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:40:02,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:40:02,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:40:02,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:40:02,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:40:02,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 18:40:02,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:40:02,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:40:02,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:40:02,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:40:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:02,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:40:02,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:02,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:40:02,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:02,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:02,485 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 30 treesize of output 32 [2022-11-25 18:40:02,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:02,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:40:02,663 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:40:02,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:40:02,754 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 19 treesize of output 18 [2022-11-25 18:40:02,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 18:40:02,886 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:40:02,886 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 80 treesize of output 57 [2022-11-25 18:40:02,902 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 0 case distinctions, treesize of input 42 treesize of output 29 [2022-11-25 18:40:03,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:03,056 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:40:03,057 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 55 treesize of output 48 [2022-11-25 18:40:03,067 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 25 [2022-11-25 18:40:03,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:40:04,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:40:04,096 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-25 18:40:04,096 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 5 case distinctions, treesize of input 73 treesize of output 51 [2022-11-25 18:40:04,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:40:04,141 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 26 [2022-11-25 18:40:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:40:04,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:40:04,926 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 10 treesize of output 8 [2022-11-25 18:40:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:30,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:30,578 INFO L321 Elim1Store]: treesize reduction 197, result has 28.1 percent of original size [2022-11-25 18:40:30,578 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 5 case distinctions, treesize of input 1533 treesize of output 1557 [2022-11-25 18:40:30,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:40:30,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1550 treesize of output 1548 [2022-11-25 18:40:30,752 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 6 treesize of output 4 [2022-11-25 18:40:31,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:31,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-11-25 18:40:31,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:31,333 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:40:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 69 [2022-11-25 18:40:31,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:40:31,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:40:31,491 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 88 [2022-11-25 18:40:31,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:40:31,530 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 358 treesize of output 344 [2022-11-25 18:40:31,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 344 [2022-11-25 18:40:31,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:40:31,889 INFO L321 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-11-25 18:40:31,889 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 38 treesize of output 43 [2022-11-25 18:40:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:40:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575788561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:40:36,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:40:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 19] total 44 [2022-11-25 18:40:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366062203] [2022-11-25 18:40:36,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:40:36,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 18:40:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:40:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 18:40:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1718, Unknown=14, NotChecked=0, Total=1892 [2022-11-25 18:40:36,475 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 44 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:40:48,589 WARN L233 SmtUtils]: Spent 8.91s on a formula simplification. DAG size of input: 118 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:40:50,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:40:52,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:40:55,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:40:57,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:41:15,808 WARN L233 SmtUtils]: Spent 15.88s on a formula simplification. DAG size of input: 121 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:44,502 WARN L233 SmtUtils]: Spent 28.31s on a formula simplification. DAG size of input: 145 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:41:46,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:41:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:41:58,837 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2022-11-25 18:41:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:41:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 44 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 18:41:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:41:58,839 INFO L225 Difference]: With dead ends: 184 [2022-11-25 18:41:58,839 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 18:41:58,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 94.9s TimeCoverageRelationStatistics Valid=410, Invalid=3355, Unknown=17, NotChecked=0, Total=3782 [2022-11-25 18:41:58,840 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 200 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 73 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:41:58,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 509 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 952 Invalid, 44 Unknown, 0 Unchecked, 17.8s Time] [2022-11-25 18:41:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 18:41:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 154. [2022-11-25 18:41:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:41:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2022-11-25 18:41:58,845 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 34 [2022-11-25 18:41:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:41:58,845 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2022-11-25 18:41:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 44 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:41:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2022-11-25 18:41:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 18:41:58,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:41:58,847 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:41:58,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:41:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:41:59,060 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:41:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:41:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -718179577, now seen corresponding path program 2 times [2022-11-25 18:41:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:41:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924534916] [2022-11-25 18:41:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:41:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:41:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:41:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:41:59,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:41:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924534916] [2022-11-25 18:41:59,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924534916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:41:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331776724] [2022-11-25 18:41:59,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:41:59,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:41:59,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:41:59,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:41:59,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:41:59,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:41:59,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:41:59,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 18:41:59,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:42:00,023 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-25 18:42:00,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-25 18:42:00,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:42:00,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:42:00,194 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 58 treesize of output 53 [2022-11-25 18:42:00,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:42:00,321 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 61 treesize of output 44 [2022-11-25 18:42:00,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:00,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2022-11-25 18:42:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:42:01,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:42:01,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_54| Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-11-25 18:42:01,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_54| Int) (v_ArrVal_1205 Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1205) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-11-25 18:42:01,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1203 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_54| Int) (v_ArrVal_1205 Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1205) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-11-25 18:42:01,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:01,503 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 33 treesize of output 34 [2022-11-25 18:42:01,508 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 60 treesize of output 56 [2022-11-25 18:42:01,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:01,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:01,526 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 27 treesize of output 31 [2022-11-25 18:42:01,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:01,538 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 19 treesize of output 17 [2022-11-25 18:42:17,873 WARN L233 SmtUtils]: Spent 16.16s on a formula simplification. DAG size of input: 43 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:42:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:42:22,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331776724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:42:22,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:42:22,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 32 [2022-11-25 18:42:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196839398] [2022-11-25 18:42:22,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:42:22,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:42:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:42:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:42:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=779, Unknown=3, NotChecked=174, Total=1056 [2022-11-25 18:42:22,147 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:42:23,725 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2022-11-25 18:42:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:42:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-25 18:42:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:42:23,727 INFO L225 Difference]: With dead ends: 168 [2022-11-25 18:42:23,727 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 18:42:23,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=183, Invalid=1232, Unknown=3, NotChecked=222, Total=1640 [2022-11-25 18:42:23,728 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:42:23,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 317 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 660 Invalid, 0 Unknown, 160 Unchecked, 0.9s Time] [2022-11-25 18:42:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 18:42:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-25 18:42:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.218978102189781) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2022-11-25 18:42:23,732 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 35 [2022-11-25 18:42:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:42:23,732 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2022-11-25 18:42:23,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-11-25 18:42:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:42:23,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:42:23,734 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:42:23,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:42:23,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:42:23,939 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:42:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:42:23,940 INFO L85 PathProgramCache]: Analyzing trace with hash 108065457, now seen corresponding path program 1 times [2022-11-25 18:42:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:42:23,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723588836] [2022-11-25 18:42:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:42:23,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:42:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:42:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:42:24,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:42:24,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723588836] [2022-11-25 18:42:24,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723588836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:42:24,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:42:24,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:42:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280590537] [2022-11-25 18:42:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:42:24,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:42:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:42:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:42:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:42:24,301 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:42:24,781 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-11-25 18:42:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:42:24,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 18:42:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:42:24,782 INFO L225 Difference]: With dead ends: 157 [2022-11-25 18:42:24,783 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 18:42:24,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:42:24,783 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:42:24,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 122 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:42:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 18:42:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2022-11-25 18:42:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.197080291970803) internal successors, (164), 148 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-11-25 18:42:24,788 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 36 [2022-11-25 18:42:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:42:24,788 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-11-25 18:42:24,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:42:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-11-25 18:42:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:42:24,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:42:24,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:42:24,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 18:42:24,790 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:42:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:42:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1288592364, now seen corresponding path program 1 times [2022-11-25 18:42:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:42:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211413040] [2022-11-25 18:42:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:42:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:42:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:42:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:42:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:42:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211413040] [2022-11-25 18:42:26,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211413040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:42:26,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770839023] [2022-11-25 18:42:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:42:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:42:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:42:26,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:42:26,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:42:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:42:26,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 18:42:26,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:42:26,593 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-25 18:42:26,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-25 18:42:26,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:42:26,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:42:26,804 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 58 treesize of output 53 [2022-11-25 18:42:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:42:27,062 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 81 treesize of output 60 [2022-11-25 18:42:27,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:42:27,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:27,896 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 68 [2022-11-25 18:42:28,359 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (let ((.cse0 (exists ((v_arrayElimCell_162 Int) (v_ArrVal_1347 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= (select .cse5 v_arrayElimCell_162) 0) (= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_#valid| (store (store .cse5 v_arrayElimCell_162 v_ArrVal_1347) |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0)))))) (.cse1 (exists ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= |c_#valid| (store .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0)) (= (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_21|) 0))))) (.cse2 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)))) (or (and (<= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 9) 0) (or .cse0 .cse1)) (and (<= 0 (+ 7 |c_ULTIMATE.start_main_~y~0#1.offset|)) (or (and .cse2 .cse0) .cse1)) (and .cse2 (exists ((v_arrayElimCell_162 Int) (v_ArrVal_1347 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (let ((.cse3 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= (select .cse3 v_arrayElimCell_162) 0) (= |c_#valid| (store (store .cse3 v_arrayElimCell_162 v_ArrVal_1347) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) 1))))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0)) is different from true [2022-11-25 18:42:28,937 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1.base| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~y~0#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_77| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse0 (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_3) |v_ULTIMATE.start_main_~y~0#1.base_77| v_DerPreprocessor_4))) (and (= (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) 1) (= |c_#valid| (store (store (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0) |v_ULTIMATE.start_main_~y~0#1.base_77| 0) |ULTIMATE.start_main_~y~0#1.base| 0)) (not (= |ULTIMATE.start_main_~y~0#1.base| |v_ULTIMATE.start_main_~y~0#1.base_77|)) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_21|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~y~0#1.base_77|) 0)))))) is different from true [2022-11-25 18:42:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:42:28,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:42:29,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_59| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_59|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_59|)))) is different from false [2022-11-25 18:42:29,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_59| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_59|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_59|)))) is different from false [2022-11-25 18:42:30,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:30,104 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 59 treesize of output 52 [2022-11-25 18:42:30,110 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 88 treesize of output 82 [2022-11-25 18:42:30,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:30,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:30,138 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 55 treesize of output 58 [2022-11-25 18:42:30,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:42:30,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:42:30,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 79 [2022-11-25 18:45:55,271 WARN L233 SmtUtils]: Spent 3.29m on a formula simplification. DAG size of input: 181 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:46:07,731 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:46:22,157 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:46:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:22,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770839023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:46:22,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:46:22,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 49 [2022-11-25 18:46:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710639260] [2022-11-25 18:46:22,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:46:22,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 18:46:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:46:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 18:46:22,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1910, Unknown=15, NotChecked=364, Total=2450 [2022-11-25 18:46:22,354 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:46:28,098 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-25 18:46:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:46:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 18:46:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:46:28,100 INFO L225 Difference]: With dead ends: 151 [2022-11-25 18:46:28,100 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 18:46:28,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 236.4s TimeCoverageRelationStatistics Valid=357, Invalid=3550, Unknown=15, NotChecked=500, Total=4422 [2022-11-25 18:46:28,102 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 105 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:46:28,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 408 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1180 Invalid, 0 Unknown, 270 Unchecked, 2.6s Time] [2022-11-25 18:46:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 18:46:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-25 18:46:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2022-11-25 18:46:28,106 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 40 [2022-11-25 18:46:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:46:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2022-11-25 18:46:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-11-25 18:46:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:46:28,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:46:28,107 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:46:28,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 18:46:28,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 18:46:28,313 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:46:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:46:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -403082130, now seen corresponding path program 1 times [2022-11-25 18:46:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:46:28,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970990286] [2022-11-25 18:46:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:46:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:46:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:46:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970990286] [2022-11-25 18:46:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970990286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:46:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578865259] [2022-11-25 18:46:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:46:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:46:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:46:29,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:46:29,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:46:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:29,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 18:46:29,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:46:29,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:46:29,517 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:46:29,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:46:29,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:46:29,587 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 19 treesize of output 18 [2022-11-25 18:46:29,660 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:46:29,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-25 18:46:29,679 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 18:46:29,680 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 44 treesize of output 41 [2022-11-25 18:46:29,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:29,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2022-11-25 18:46:29,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:29,767 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 18:46:29,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:29,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 18:46:30,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:30,315 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:46:30,315 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-25 18:46:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:30,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:46:30,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 Int) (v_ArrVal_1486 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1488 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1486))) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1490))) (select (select (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| .cse1) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1488) |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (+ (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_65|) 8)))) 0))) is different from false [2022-11-25 18:46:30,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:30,771 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 126 treesize of output 127 [2022-11-25 18:46:30,777 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 246 treesize of output 242 [2022-11-25 18:46:30,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:30,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 110 [2022-11-25 18:46:30,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:30,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:30,817 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 120 treesize of output 124 [2022-11-25 18:46:39,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:39,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:40,006 INFO L321 Elim1Store]: treesize reduction 153, result has 27.8 percent of original size [2022-11-25 18:46:40,007 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 3177 treesize of output 714 [2022-11-25 18:46:40,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:40,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:40,052 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 737 treesize of output 659 [2022-11-25 18:46:40,083 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:46:40,083 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 13 treesize of output 12 [2022-11-25 18:46:40,311 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 12 treesize of output 3 [2022-11-25 18:46:40,349 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 304 treesize of output 288 [2022-11-25 18:46:40,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:40,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:40,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:40,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2022-11-25 18:46:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:40,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578865259] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:46:40,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:46:40,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-11-25 18:46:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809065659] [2022-11-25 18:46:40,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:46:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:46:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:46:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:46:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=878, Unknown=1, NotChecked=60, Total=1056 [2022-11-25 18:46:40,487 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:46,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:46:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:46:53,277 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-11-25 18:46:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 18:46:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 18:46:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:46:53,278 INFO L225 Difference]: With dead ends: 172 [2022-11-25 18:46:53,278 INFO L226 Difference]: Without dead ends: 172 [2022-11-25 18:46:53,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=811, Invalid=3481, Unknown=2, NotChecked=128, Total=4422 [2022-11-25 18:46:53,280 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 182 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:46:53,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 558 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1287 Invalid, 0 Unknown, 136 Unchecked, 5.6s Time] [2022-11-25 18:46:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-25 18:46:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2022-11-25 18:46:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-11-25 18:46:53,285 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 40 [2022-11-25 18:46:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:46:53,285 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-11-25 18:46:53,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:46:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-11-25 18:46:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:46:53,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:46:53,286 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:46:53,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:46:53,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 18:46:53,495 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:46:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:46:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 389355959, now seen corresponding path program 1 times [2022-11-25 18:46:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:46:53,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840163021] [2022-11-25 18:46:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:46:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:46:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:46:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840163021] [2022-11-25 18:46:54,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840163021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:46:54,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480204112] [2022-11-25 18:46:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:46:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:46:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:46:54,548 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:46:54,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:46:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:54,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 18:46:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:46:54,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:46:54,818 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:46:54,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:46:54,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:46:54,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:46:54,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:54,958 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 1 case distinctions, treesize of input 51 treesize of output 40 [2022-11-25 18:46:54,975 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 18 treesize of output 20 [2022-11-25 18:46:55,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:55,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:46:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:55,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:55,084 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:46:55,084 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 35 treesize of output 36 [2022-11-25 18:46:55,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:55,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:46:55,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:46:55,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:55,622 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 18:46:55,622 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 25 [2022-11-25 18:46:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:46:55,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:46:56,194 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1628 Int) (v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1629 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_70| Int) (v_ArrVal_1624 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_70|)) (<= (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1624)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1628))) (select (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| .cse1) (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_70|)))) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1629) |v_ULTIMATE.start_main_~list~0#1.offset_70|) 8))) 1) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_70| |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-11-25 18:46:56,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:56,211 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 128 treesize of output 129 [2022-11-25 18:46:56,216 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 250 treesize of output 246 [2022-11-25 18:46:56,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:56,227 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 114 treesize of output 112 [2022-11-25 18:46:56,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:56,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:46:56,256 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 122 treesize of output 126 [2022-11-25 18:47:16,796 WARN L233 SmtUtils]: Spent 15.54s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:47:23,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:23,473 INFO L321 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-11-25 18:47:23,474 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 11100 treesize of output 2191 [2022-11-25 18:47:23,506 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:47:23,507 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 2603 treesize of output 2117 [2022-11-25 18:47:23,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:23,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:23,533 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1722 treesize of output 828 [2022-11-25 18:47:23,547 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 830 treesize of output 794 [2022-11-25 18:47:23,570 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:47:23,571 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 13 treesize of output 12 [2022-11-25 18:47:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:23,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480204112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:47:23,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:47:23,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-11-25 18:47:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599312171] [2022-11-25 18:47:23,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:47:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 18:47:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 18:47:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=823, Unknown=3, NotChecked=58, Total=992 [2022-11-25 18:47:23,733 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:47:29,463 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2022-11-25 18:47:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:47:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 18:47:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:47:29,465 INFO L225 Difference]: With dead ends: 155 [2022-11-25 18:47:29,466 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 18:47:29,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=628, Invalid=2913, Unknown=3, NotChecked=116, Total=3660 [2022-11-25 18:47:29,467 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 164 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:47:29,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 553 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1497 Invalid, 0 Unknown, 97 Unchecked, 3.0s Time] [2022-11-25 18:47:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 18:47:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2022-11-25 18:47:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-25 18:47:29,471 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 41 [2022-11-25 18:47:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:47:29,471 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-25 18:47:29,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-25 18:47:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:47:29,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:47:29,473 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:47:29,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:47:29,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 18:47:29,678 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:47:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -814867056, now seen corresponding path program 1 times [2022-11-25 18:47:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238667015] [2022-11-25 18:47:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238667015] [2022-11-25 18:47:30,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238667015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:47:30,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093158512] [2022-11-25 18:47:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:30,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:47:30,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:47:30,835 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:47:30,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 18:47:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:31,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:47:31,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:47:31,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:47:31,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:47:31,163 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-25 18:47:31,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-25 18:47:31,234 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 24 [2022-11-25 18:47:31,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-11-25 18:47:31,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:31,321 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 1 case distinctions, treesize of input 78 treesize of output 55 [2022-11-25 18:47:31,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 18:47:31,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,470 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 38 treesize of output 33 [2022-11-25 18:47:31,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:31,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:31,495 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:47:31,496 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 73 treesize of output 61 [2022-11-25 18:47:31,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:31,746 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-25 18:47:32,091 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 18:47:32,092 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 1 case distinctions, treesize of input 29 treesize of output 34 [2022-11-25 18:47:32,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:32,462 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 18:47:32,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 37 [2022-11-25 18:47:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:32,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:47:35,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:35,869 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 131 treesize of output 132 [2022-11-25 18:47:35,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 252 [2022-11-25 18:47:35,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:35,886 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 117 treesize of output 115 [2022-11-25 18:47:35,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:35,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:35,930 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 125 treesize of output 129 [2022-11-25 18:47:44,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:44,781 INFO L321 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-11-25 18:47:44,781 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1291 treesize of output 327 [2022-11-25 18:47:44,805 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-25 18:47:44,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 541 treesize of output 385 [2022-11-25 18:47:44,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:44,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:44,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 136 [2022-11-25 18:47:44,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:47:44,826 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 148 treesize of output 100 [2022-11-25 18:47:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:44,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093158512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:47:44,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:47:44,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2022-11-25 18:47:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332704674] [2022-11-25 18:47:44,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:47:44,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:47:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:47:44,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1320, Unknown=8, NotChecked=0, Total=1482 [2022-11-25 18:47:44,963 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:47:48,340 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-11-25 18:47:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:47:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 18:47:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:47:48,343 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:47:48,343 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 18:47:48,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=513, Invalid=2341, Unknown=8, NotChecked=0, Total=2862 [2022-11-25 18:47:48,346 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 186 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:47:48,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 264 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 18:47:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 18:47:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2022-11-25 18:47:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.1953125) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-11-25 18:47:48,355 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 42 [2022-11-25 18:47:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:47:48,356 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-11-25 18:47:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:47:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-11-25 18:47:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:47:48,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:47:48,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:47:48,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 18:47:48,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 18:47:48,563 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:47:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:47:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -953430234, now seen corresponding path program 3 times [2022-11-25 18:47:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:47:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509950454] [2022-11-25 18:47:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:47:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:47:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:47:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:49,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:47:49,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509950454] [2022-11-25 18:47:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509950454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:47:49,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040431721] [2022-11-25 18:47:49,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:47:49,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:47:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:47:49,823 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:47:49,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66e3dee5-fb8b-4aff-8e24-909d3209da82/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 18:47:50,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:47:50,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:47:50,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 18:47:50,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:47:50,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:47:50,091 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:47:50,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:47:50,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:47:50,231 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:47:50,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 18:47:50,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:50,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 18:47:50,404 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-25 18:47:50,404 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 26 treesize of output 41 [2022-11-25 18:47:50,497 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 37 treesize of output 28 [2022-11-25 18:47:50,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:50,611 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:47:50,611 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 72 treesize of output 45 [2022-11-25 18:47:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:50,720 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:47:50,721 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 64 treesize of output 45 [2022-11-25 18:47:51,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:51,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 34 [2022-11-25 18:47:51,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:51,504 INFO L321 Elim1Store]: treesize reduction 40, result has 28.6 percent of original size [2022-11-25 18:47:51,504 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 46 [2022-11-25 18:47:51,901 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-25 18:47:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:47:51,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:48:18,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:48:18,555 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 324 treesize of output 205 [2022-11-25 18:48:18,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:48:19,188 INFO L321 Elim1Store]: treesize reduction 556, result has 19.9 percent of original size [2022-11-25 18:48:19,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 360384 treesize of output 330261 [2022-11-25 18:48:20,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:48:20,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:48:20,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:48:20,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 651825 treesize of output 639297 [2022-11-25 18:48:51,702 WARN L233 SmtUtils]: Spent 30.85s on a formula simplification. DAG size of input: 1653 DAG size of output: 1647 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:48:55,612 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 129648 treesize of output 129624