./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc --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 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 --- 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-5e519f3 [2022-11-02 20:09:35,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:09:35,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:09:35,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:09:35,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:09:35,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:09:35,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:09:35,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:09:35,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:09:35,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:09:35,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:09:35,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:09:35,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:09:35,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:09:35,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:09:35,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:09:35,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:09:35,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:09:35,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:09:35,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:09:35,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:09:35,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:09:35,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:09:35,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:09:35,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:09:35,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:09:35,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:09:35,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:09:35,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:09:35,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:09:35,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:09:35,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:09:35,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:09:35,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:09:35,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:09:35,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:09:35,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:09:35,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:09:35,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:09:35,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:09:35,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:09:35,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:09:35,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:09:35,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:09:35,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:09:35,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:09:35,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:09:35,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:09:35,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:09:35,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:09:35,224 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:09:35,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:09:35,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:09:35,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:09:35,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:09:35,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:09:35,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:09:35,226 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:09:35,226 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:09:35,226 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:09:35,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:09:35,227 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:09:35,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:09:35,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:09:35,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:09:35,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:09:35,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:09:35,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:09:35,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:09:35,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:09:35,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:09:35,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:09:35,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/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_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc 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 -> 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 [2022-11-02 20:09:35,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:09:35,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:09:35,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:09:35,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:09:35,553 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:09:35,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2022-11-02 20:09:35,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/data/a39800186/654b7bfb77e74f4a9a7dc4e93d3f542b/FLAG6369890e4 [2022-11-02 20:09:36,189 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:09:36,189 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2022-11-02 20:09:36,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/data/a39800186/654b7bfb77e74f4a9a7dc4e93d3f542b/FLAG6369890e4 [2022-11-02 20:09:36,490 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/data/a39800186/654b7bfb77e74f4a9a7dc4e93d3f542b [2022-11-02 20:09:36,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:09:36,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:09:36,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:09:36,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:09:36,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:09:36,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:09:36" (1/1) ... [2022-11-02 20:09:36,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4936f7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:36, skipping insertion in model container [2022-11-02 20:09:36,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:09:36" (1/1) ... [2022-11-02 20:09:36,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:09:36,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:09:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i[23654,23667] [2022-11-02 20:09:36,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:09:36,917 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:09:36,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i[23654,23667] [2022-11-02 20:09:36,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:09:37,002 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:09:37,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37 WrapperNode [2022-11-02 20:09:37,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:09:37,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:09:37,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:09:37,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:09:37,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,047 INFO L138 Inliner]: procedures = 124, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2022-11-02 20:09:37,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:09:37,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:09:37,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:09:37,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:09:37,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,105 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:09:37,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:09:37,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:09:37,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:09:37,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (1/1) ... [2022-11-02 20:09:37,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:09:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:37,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:09:37,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:09:37,203 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:09:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:09:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:09:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:09:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:09:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:09:37,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:09:37,327 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:09:37,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:09:37,362 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:09:37,647 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:09:37,653 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:09:37,653 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:09:37,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:09:37 BoogieIcfgContainer [2022-11-02 20:09:37,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:09:37,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:09:37,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:09:37,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:09:37,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:09:36" (1/3) ... [2022-11-02 20:09:37,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:09:37, skipping insertion in model container [2022-11-02 20:09:37,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:37" (2/3) ... [2022-11-02 20:09:37,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:09:37, skipping insertion in model container [2022-11-02 20:09:37,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:09:37" (3/3) ... [2022-11-02 20:09:37,678 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1.i [2022-11-02 20:09:37,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:09:37,710 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-02 20:09:37,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:09:37,771 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53d2ed7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:09:37,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-11-02 20:09:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:09:37,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:37,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:09:37,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517928, now seen corresponding path program 1 times [2022-11-02 20:09:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:37,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459220437] [2022-11-02 20:09:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,987 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-02 20:09:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:37,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459220437] [2022-11-02 20:09:38,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459220437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:38,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:09:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364365084] [2022-11-02 20:09:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:38,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:09:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:38,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:09:38,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:09:38,061 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02 20:09:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:38,093 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-11-02 20:09:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:09:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-02 20:09:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:38,105 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:09:38,105 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:09:38,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:09:38,110 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:38,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:09:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:09:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-02 20:09:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 84 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-02 20:09:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-11-02 20:09:38,147 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2022-11-02 20:09:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:38,148 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-11-02 20:09:38,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02 20:09:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-11-02 20:09:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:09:38,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:38,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:38,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:09:38,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 620871761, now seen corresponding path program 1 times [2022-11-02 20:09:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:38,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68722535] [2022-11-02 20:09:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:38,269 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-02 20:09:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68722535] [2022-11-02 20:09:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68722535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:38,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:38,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302674552] [2022-11-02 20:09:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:38,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:38,273 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-02 20:09:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:38,460 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-11-02 20:09:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-11-02 20:09:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:38,465 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:09:38,465 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:09:38,468 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-02 20:09:38,469 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 151 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:38,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 45 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:09:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-11-02 20:09:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.75) internal successors, (91), 77 states have internal predecessors, (91), 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-02 20:09:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2022-11-02 20:09:38,479 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 8 [2022-11-02 20:09:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:38,479 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2022-11-02 20:09:38,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-02 20:09:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-11-02 20:09:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:09:38,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:38,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:38,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:09:38,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:38,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash 620871762, now seen corresponding path program 1 times [2022-11-02 20:09:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:38,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306938210] [2022-11-02 20:09:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:38,660 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-02 20:09:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:38,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306938210] [2022-11-02 20:09:38,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306938210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:38,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:38,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121323308] [2022-11-02 20:09:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:38,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:38,665 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-02 20:09:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:38,887 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2022-11-02 20:09:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:38,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-11-02 20:09:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:38,889 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:09:38,889 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:09:38,890 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-02 20:09:38,891 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 165 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:38,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 56 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:09:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2022-11-02 20:09:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-02 20:09:38,901 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 8 [2022-11-02 20:09:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:38,901 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-02 20:09:38,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-02 20:09:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-02 20:09:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:09:38,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:38,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:38,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:09:38,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 623916195, now seen corresponding path program 1 times [2022-11-02 20:09:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:38,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049289042] [2022-11-02 20:09:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:39,048 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-02 20:09:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:39,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049289042] [2022-11-02 20:09:39,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049289042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:39,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:39,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904760437] [2022-11-02 20:09:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:39,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:39,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:39,055 INFO L87 Difference]: Start difference. First operand 102 states and 117 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-02 20:09:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:39,188 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2022-11-02 20:09:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:09:39,189 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-02 20:09:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:39,190 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:09:39,190 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:09:39,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:09:39,191 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:39,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 209 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:09:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2022-11-02 20:09:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-11-02 20:09:39,200 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 15 [2022-11-02 20:09:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:39,201 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-11-02 20:09:39,201 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-02 20:09:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-11-02 20:09:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:09:39,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:39,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:39,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:09:39,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1684958094, now seen corresponding path program 1 times [2022-11-02 20:09:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131954700] [2022-11-02 20:09:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:39,434 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-02 20:09:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131954700] [2022-11-02 20:09:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131954700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:39,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:09:39,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754008110] [2022-11-02 20:09:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:39,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:09:39,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:09:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:09:39,438 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:39,668 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2022-11-02 20:09:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:09:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:39,670 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:09:39,670 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:09:39,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:09:39,671 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 107 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:39,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 199 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:09:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2022-11-02 20:09:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5125) internal successors, (121), 105 states have internal predecessors, (121), 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-02 20:09:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2022-11-02 20:09:39,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2022-11-02 20:09:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2022-11-02 20:09:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2022-11-02 20:09:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:09:39,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:39,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:39,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:09:39,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1529942363, now seen corresponding path program 1 times [2022-11-02 20:09:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251883440] [2022-11-02 20:09:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:39,757 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-02 20:09:39,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251883440] [2022-11-02 20:09:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251883440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:39,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:39,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362613124] [2022-11-02 20:09:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:39,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:39,760 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02 20:09:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:39,876 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-11-02 20:09:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02 20:09:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:39,878 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:09:39,878 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:09:39,879 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-02 20:09:39,880 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 141 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:39,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 77 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:09:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2022-11-02 20:09:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 107 states have internal predecessors, (123), 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-02 20:09:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-11-02 20:09:39,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 18 [2022-11-02 20:09:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:39,887 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-11-02 20:09:39,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02 20:09:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-11-02 20:09:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:09:39,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:39,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:09:39,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1395789589, now seen corresponding path program 1 times [2022-11-02 20:09:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640177953] [2022-11-02 20:09:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:40,027 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-02 20:09:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640177953] [2022-11-02 20:09:40,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640177953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:40,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:40,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665142023] [2022-11-02 20:09:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:40,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:09:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:09:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:40,030 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:40,193 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-11-02 20:09:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:09:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:09:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:40,196 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:09:40,196 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 20:09:40,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:09:40,198 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:40,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 185 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 20:09:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2022-11-02 20:09:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 111 states have internal predecessors, (127), 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-02 20:09:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-11-02 20:09:40,226 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 20 [2022-11-02 20:09:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:40,227 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-11-02 20:09:40,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-11-02 20:09:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:09:40,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:40,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:40,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:09:40,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534887, now seen corresponding path program 1 times [2022-11-02 20:09:40,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:40,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388193207] [2022-11-02 20:09:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:40,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:40,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388193207] [2022-11-02 20:09:40,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388193207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:40,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:40,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:09:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307991386] [2022-11-02 20:09:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:40,464 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02 20:09:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:40,655 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-11-02 20:09:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2022-11-02 20:09:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:40,657 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:09:40,658 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:09:40,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:09:40,660 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:40,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 162 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:09:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2022-11-02 20:09:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 109 states have internal predecessors, (125), 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-02 20:09:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-11-02 20:09:40,670 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 21 [2022-11-02 20:09:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:40,672 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-11-02 20:09:40,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02 20:09:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-11-02 20:09:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:09:40,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:40,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:40,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:09:40,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534886, now seen corresponding path program 1 times [2022-11-02 20:09:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:40,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793234625] [2022-11-02 20:09:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793234625] [2022-11-02 20:09:40,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793234625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:40,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:41,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:09:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019541412] [2022-11-02 20:09:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:41,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:41,002 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02 20:09:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:41,268 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-11-02 20:09:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:09:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2022-11-02 20:09:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:41,269 INFO L225 Difference]: With dead ends: 108 [2022-11-02 20:09:41,269 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:09:41,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:09:41,270 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:41,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 219 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:09:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2022-11-02 20:09:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 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-02 20:09:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-11-02 20:09:41,273 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2022-11-02 20:09:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:41,274 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-11-02 20:09:41,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02 20:09:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-11-02 20:09:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:09:41,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:41,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:41,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:09:41,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 37796891, now seen corresponding path program 1 times [2022-11-02 20:09:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412356834] [2022-11-02 20:09:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:41,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:41,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412356834] [2022-11-02 20:09:41,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412356834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:41,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:41,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:09:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365339914] [2022-11-02 20:09:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:41,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:09:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:09:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:09:41,666 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-02 20:09:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:41,882 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2022-11-02 20:09:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:09:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 22 [2022-11-02 20:09:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:41,885 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:09:41,885 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 20:09:41,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:09:41,886 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:41,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 161 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:09:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 20:09:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-11-02 20:09:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 82 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-02 20:09:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2022-11-02 20:09:41,891 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 22 [2022-11-02 20:09:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:41,892 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2022-11-02 20:09:41,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-02 20:09:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2022-11-02 20:09:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:09:41,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:41,894 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] [2022-11-02 20:09:41,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:09:41,894 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 615949290, now seen corresponding path program 1 times [2022-11-02 20:09:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:41,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027916276] [2022-11-02 20:09:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:42,608 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-02 20:09:42,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:42,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027916276] [2022-11-02 20:09:42,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027916276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:42,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863697215] [2022-11-02 20:09:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:42,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:42,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:42,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:09:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:42,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:09:42,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:42,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:43,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:43,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-02 20:09:43,185 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:43,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:43,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:43,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:43,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:43,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2022-11-02 20:09:43,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-11-02 20:09:43,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:09:43,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:09:43,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:43,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-11-02 20:09:43,746 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-02 20:09:43,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:43,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:09:43,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:09:43,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:09:43,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 Int) (v_ArrVal_200 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_196)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:09:44,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:44,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-11-02 20:09:44,280 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-02 20:09:44,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 46 [2022-11-02 20:09:44,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-11-02 20:09:44,298 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:09:44,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:09:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863697215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:44,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:44,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2022-11-02 20:09:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638014746] [2022-11-02 20:09:44,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:09:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:09:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=904, Unknown=4, NotChecked=268, Total=1406 [2022-11-02 20:09:44,397 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 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-02 20:09:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:45,405 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2022-11-02 20:09:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:09:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 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) Word has length 30 [2022-11-02 20:09:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:45,407 INFO L225 Difference]: With dead ends: 185 [2022-11-02 20:09:45,407 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 20:09:45,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=1195, Unknown=4, NotChecked=316, Total=1892 [2022-11-02 20:09:45,409 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 224 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 842 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:45,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 770 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 732 Invalid, 0 Unknown, 842 Unchecked, 0.6s Time] [2022-11-02 20:09:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 20:09:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 103. [2022-11-02 20:09:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 102 states have internal predecessors, (120), 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-02 20:09:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2022-11-02 20:09:45,413 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 30 [2022-11-02 20:09:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:45,413 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2022-11-02 20:09:45,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 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-02 20:09:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2022-11-02 20:09:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:09:45,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:45,414 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] [2022-11-02 20:09:45,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:45,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:45,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 615641460, now seen corresponding path program 1 times [2022-11-02 20:09:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:45,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047697711] [2022-11-02 20:09:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:46,010 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-02 20:09:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047697711] [2022-11-02 20:09:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047697711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665697535] [2022-11-02 20:09:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:46,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:46,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:46,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:09:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:46,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:09:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:46,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:46,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:46,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-11-02 20:09:46,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:09:46,616 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-02 20:09:46,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:46,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:09:46,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:09:46,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:09:46,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 Int) (v_ArrVal_276 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_272)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:09:46,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:46,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-02 20:09:46,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:46,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-11-02 20:09:46,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:46,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:46,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:09:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:09:47,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665697535] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:47,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:47,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-02 20:09:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568829626] [2022-11-02 20:09:47,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:47,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:09:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:47,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:09:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2022-11-02 20:09:47,083 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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-02 20:09:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:47,739 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2022-11-02 20:09:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:09:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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) Word has length 30 [2022-11-02 20:09:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:47,740 INFO L225 Difference]: With dead ends: 265 [2022-11-02 20:09:47,741 INFO L226 Difference]: Without dead ends: 265 [2022-11-02 20:09:47,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=723, Unknown=4, NotChecked=244, Total=1190 [2022-11-02 20:09:47,742 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 322 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:47,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 657 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 515 Invalid, 0 Unknown, 744 Unchecked, 0.4s Time] [2022-11-02 20:09:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-02 20:09:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 105. [2022-11-02 20:09:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 104 states have internal predecessors, (122), 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-02 20:09:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2022-11-02 20:09:47,746 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 30 [2022-11-02 20:09:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:47,746 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2022-11-02 20:09:47,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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-02 20:09:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2022-11-02 20:09:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:09:47,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:47,747 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] [2022-11-02 20:09:47,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:47,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:09:47,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1355563894, now seen corresponding path program 1 times [2022-11-02 20:09:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:47,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151165473] [2022-11-02 20:09:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:48,308 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-02 20:09:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151165473] [2022-11-02 20:09:48,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151165473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165871993] [2022-11-02 20:09:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:48,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:48,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:48,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:09:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:48,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:09:48,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:48,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:48,638 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:48,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:48,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:48,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:48,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-11-02 20:09:48,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:48,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:48,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:09:48,947 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-02 20:09:48,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:48,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 20:09:48,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 20:09:48,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:09:48,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int)) (v_ArrVal_349 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_349)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:09:49,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:49,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-02 20:09:49,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:49,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-11-02 20:09:49,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:49,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:49,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:09:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:09:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165871993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:49,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-02 20:09:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136697222] [2022-11-02 20:09:49,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:09:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:09:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=485, Unknown=4, NotChecked=196, Total=812 [2022-11-02 20:09:49,478 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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-02 20:09:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:50,259 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2022-11-02 20:09:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:09:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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) Word has length 30 [2022-11-02 20:09:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:50,261 INFO L225 Difference]: With dead ends: 215 [2022-11-02 20:09:50,261 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 20:09:50,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=768, Unknown=4, NotChecked=252, Total=1260 [2022-11-02 20:09:50,263 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 372 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:50,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 642 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 604 Invalid, 0 Unknown, 772 Unchecked, 0.5s Time] [2022-11-02 20:09:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 20:09:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2022-11-02 20:09:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 122 states have internal predecessors, (144), 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-02 20:09:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-11-02 20:09:50,268 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 30 [2022-11-02 20:09:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-11-02 20:09:50,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 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-02 20:09:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-11-02 20:09:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:09:50,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:50,270 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] [2022-11-02 20:09:50,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:50,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:09:50,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1355871724, now seen corresponding path program 1 times [2022-11-02 20:09:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:50,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224944665] [2022-11-02 20:09:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,031 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-02 20:09:51,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:51,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224944665] [2022-11-02 20:09:51,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224944665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:51,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391350592] [2022-11-02 20:09:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:51,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:51,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:51,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:51,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:09:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 20:09:51,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:51,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:51,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,343 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:51,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:51,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:09:51,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:09:51,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:09:51,493 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-02 20:09:51,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:51,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:09:51,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:09:51,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:09:51,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_428 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_428)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:09:51,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:51,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 41 [2022-11-02 20:09:51,828 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:09:51,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 31 [2022-11-02 20:09:51,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:09:51,846 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:09:51,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:09:51,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391350592] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:51,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:51,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 31 [2022-11-02 20:09:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953393561] [2022-11-02 20:09:51,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:09:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:51,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:09:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=559, Unknown=7, NotChecked=212, Total=930 [2022-11-02 20:09:51,902 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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-02 20:09:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:52,762 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-11-02 20:09:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:09:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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 30 [2022-11-02 20:09:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:52,764 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:09:52,764 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 20:09:52,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=750, Unknown=7, NotChecked=252, Total=1260 [2022-11-02 20:09:52,765 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 291 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 935 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:52,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 753 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 863 Invalid, 0 Unknown, 935 Unchecked, 0.6s Time] [2022-11-02 20:09:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 20:09:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2022-11-02 20:09:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 122 states have internal predecessors, (143), 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-02 20:09:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2022-11-02 20:09:52,770 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 30 [2022-11-02 20:09:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2022-11-02 20:09:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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-02 20:09:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-11-02 20:09:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:09:52,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:52,771 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, 1] [2022-11-02 20:09:52,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:52,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:09:52,996 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:09:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025696, now seen corresponding path program 1 times [2022-11-02 20:09:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:52,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703233708] [2022-11-02 20:09:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:53,426 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-02 20:09:53,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703233708] [2022-11-02 20:09:53,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703233708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:53,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891737216] [2022-11-02 20:09:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:53,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:53,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:53,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:53,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:09:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:53,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:09:53,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:53,663 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:09:53,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:53,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:53,855 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:53,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:09:53,877 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:53,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:09:53,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:09:54,031 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-02 20:09:54,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:54,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-02 20:09:54,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-02 20:09:54,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:54,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-02 20:09:54,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:54,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 39 [2022-11-02 20:09:54,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-02 20:09:58,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:58,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-11-02 20:10:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:10:00,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891737216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:00,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:00,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-11-02 20:10:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631655435] [2022-11-02 20:10:00,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:10:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:10:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=8, NotChecked=118, Total=1056 [2022-11-02 20:10:00,532 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 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-02 20:10:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:01,339 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2022-11-02 20:10:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:10:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:10:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:01,341 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:10:01,341 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:10:01,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=8, NotChecked=146, Total=1560 [2022-11-02 20:10:01,342 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 577 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:01,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 572 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 676 Invalid, 0 Unknown, 684 Unchecked, 0.6s Time] [2022-11-02 20:10:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:10:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2022-11-02 20:10:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 125 states have internal predecessors, (147), 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-02 20:10:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-11-02 20:10:01,347 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 32 [2022-11-02 20:10:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:01,348 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-11-02 20:10:01,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 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-02 20:10:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-11-02 20:10:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:10:01,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:01,349 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, 1] [2022-11-02 20:10:01,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:01,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:10:01,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025695, now seen corresponding path program 1 times [2022-11-02 20:10:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:01,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673432983] [2022-11-02 20:10:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:02,190 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-02 20:10:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673432983] [2022-11-02 20:10:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673432983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297735973] [2022-11-02 20:10:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:02,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:02,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:10:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:02,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:10:02,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:02,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:02,443 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:02,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:02,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:02,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:02,671 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:02,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:10:02,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:02,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:10:02,722 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:02,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:10:02,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:10:02,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:02,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 13 [2022-11-02 20:10:02,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:02,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:10:03,008 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-02 20:10:03,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:03,252 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8)))))) is different from false [2022-11-02 20:10:03,372 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|))))) is different from false [2022-11-02 20:10:03,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_65| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_65| 8))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_65|)))))) is different from false [2022-11-02 20:10:03,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-02 20:10:03,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:10:03,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:10:03,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-02 20:10:03,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-02 20:10:03,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:03,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:03,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:03,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 21 [2022-11-02 20:10:03,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:03,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:03,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-02 20:10:03,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 20:10:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:10:04,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297735973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:04,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:04,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2022-11-02 20:10:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516303264] [2022-11-02 20:10:04,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:04,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:10:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:10:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=791, Unknown=3, NotChecked=180, Total=1122 [2022-11-02 20:10:04,175 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 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-02 20:10:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:05,633 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2022-11-02 20:10:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:10:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:10:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:05,635 INFO L225 Difference]: With dead ends: 212 [2022-11-02 20:10:05,635 INFO L226 Difference]: Without dead ends: 212 [2022-11-02 20:10:05,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=1722, Unknown=3, NotChecked=276, Total=2450 [2022-11-02 20:10:05,636 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 677 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:05,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 601 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 634 Invalid, 0 Unknown, 715 Unchecked, 0.6s Time] [2022-11-02 20:10:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-02 20:10:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 124. [2022-11-02 20:10:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 123 states have internal predecessors, (145), 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-02 20:10:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-11-02 20:10:05,641 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 32 [2022-11-02 20:10:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:05,641 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-11-02 20:10:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 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-02 20:10:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-11-02 20:10:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:10:05,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:05,642 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, 1, 1] [2022-11-02 20:10:05,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:10:05,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1553010291, now seen corresponding path program 1 times [2022-11-02 20:10:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323413336] [2022-11-02 20:10:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:06,205 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-02 20:10:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323413336] [2022-11-02 20:10:06,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323413336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:06,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847607894] [2022-11-02 20:10:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:06,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:06,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:10:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:06,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:10:06,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:06,455 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:06,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:06,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:06,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:06,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-11-02 20:10:06,702 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:06,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-11-02 20:10:06,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:06,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-11-02 20:10:06,905 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-02 20:10:06,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:07,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_654 (Array Int Int))) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:10:07,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_654 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:10:07,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_76| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_654) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_76| 8)) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_76|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_76| 1) 0))) is different from false [2022-11-02 20:10:07,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:07,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-02 20:10:07,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:07,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 38 [2022-11-02 20:10:07,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-11-02 20:10:07,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:07,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 52 [2022-11-02 20:10:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:10:07,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847607894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:07,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:07,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-02 20:10:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107432616] [2022-11-02 20:10:07,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:07,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:10:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:10:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-11-02 20:10:07,581 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:08,258 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-11-02 20:10:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:10:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:10:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:08,259 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:10:08,259 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:10:08,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1357, Unknown=4, NotChecked=234, Total=1806 [2022-11-02 20:10:08,260 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 109 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:08,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 733 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 380 Invalid, 0 Unknown, 310 Unchecked, 0.3s Time] [2022-11-02 20:10:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:10:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2022-11-02 20:10:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 123 states have internal predecessors, (144), 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-02 20:10:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2022-11-02 20:10:08,264 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 33 [2022-11-02 20:10:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:08,264 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2022-11-02 20:10:08,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2022-11-02 20:10:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:10:08,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:08,265 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, 1, 1] [2022-11-02 20:10:08,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:08,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:08,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1881518547, now seen corresponding path program 1 times [2022-11-02 20:10:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:08,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430251499] [2022-11-02 20:10:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:08,821 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-02 20:10:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430251499] [2022-11-02 20:10:08,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430251499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38626105] [2022-11-02 20:10:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:08,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:08,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:10:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:08,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:10:08,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:09,092 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:09,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:09,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:09,310 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:09,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-11-02 20:10:09,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:09,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-11-02 20:10:09,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:09,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-11-02 20:10:09,564 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-02 20:10:09,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:09,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:10:09,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-11-02 20:10:09,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_86| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_728) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_86| 8)) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_86|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_86| 1) 0))) is different from false [2022-11-02 20:10:09,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:09,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-02 20:10:09,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:09,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 38 [2022-11-02 20:10:09,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-11-02 20:10:10,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:10,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 52 [2022-11-02 20:10:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:10:10,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38626105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:10,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:10,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-02 20:10:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727650531] [2022-11-02 20:10:10,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:10:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:10:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-11-02 20:10:10,275 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:11,073 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2022-11-02 20:10:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:10:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:10:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:11,074 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:10:11,074 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 20:10:11,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=268, Invalid=1381, Unknown=3, NotChecked=240, Total=1892 [2022-11-02 20:10:11,076 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 261 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:11,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 671 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 481 Invalid, 0 Unknown, 629 Unchecked, 0.3s Time] [2022-11-02 20:10:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 20:10:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2022-11-02 20:10:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 123 states have internal predecessors, (143), 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-02 20:10:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2022-11-02 20:10:11,082 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 33 [2022-11-02 20:10:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:11,082 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2022-11-02 20:10:11,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-11-02 20:10:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:10:11,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:11,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:11,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:11,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:10:11,296 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1240762011, now seen corresponding path program 1 times [2022-11-02 20:10:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:11,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698168485] [2022-11-02 20:10:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:11,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698168485] [2022-11-02 20:10:11,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698168485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364806225] [2022-11-02 20:10:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:11,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:11,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:10:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:11,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:10:11,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:11,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:11,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:11,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364806225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:11,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:11,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 20:10:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481936668] [2022-11-02 20:10:11,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:11,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:10:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:10:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:10:11,647 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-02 20:10:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:12,002 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2022-11-02 20:10:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:10:12,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 36 [2022-11-02 20:10:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:12,008 INFO L225 Difference]: With dead ends: 303 [2022-11-02 20:10:12,009 INFO L226 Difference]: Without dead ends: 303 [2022-11-02 20:10:12,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:10:12,011 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 338 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:12,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 491 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:10:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-02 20:10:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 154. [2022-11-02 20:10:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 153 states have internal predecessors, (195), 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-02 20:10:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2022-11-02 20:10:12,029 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 36 [2022-11-02 20:10:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:12,029 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2022-11-02 20:10:12,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-02 20:10:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2022-11-02 20:10:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:10:12,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:12,030 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:12,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:12,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:12,244 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1655615668, now seen corresponding path program 1 times [2022-11-02 20:10:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:12,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711980988] [2022-11-02 20:10:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711980988] [2022-11-02 20:10:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711980988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581387793] [2022-11-02 20:10:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:12,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:12,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:10:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:12,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:10:12,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:13,085 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:13,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:13,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:13,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:13,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:13,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:13,369 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:10:13,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:10:13,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:10:13,394 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:13,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:10:13,480 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:13,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 89 [2022-11-02 20:10:13,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-02 20:10:13,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-02 20:10:13,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:13,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 26 [2022-11-02 20:10:13,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:13,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 14 [2022-11-02 20:10:13,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:13,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:14,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_874 Int) (v_ArrVal_877 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_92| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~p~0#1.offset_92| 8))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_874)) .cse0) .cse1) 3) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_92| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ 8 .cse1) (select |c_#length| .cse0))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_92|)))))) is different from false [2022-11-02 20:10:14,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 199 treesize of output 177 [2022-11-02 20:10:14,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:14,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 155 treesize of output 136 [2022-11-02 20:10:14,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:14,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 112 [2022-11-02 20:10:15,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:15,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 181 treesize of output 187 [2022-11-02 20:10:15,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:15,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 266 treesize of output 248 [2022-11-02 20:10:15,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 213 treesize of output 201 [2022-11-02 20:10:15,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 193 [2022-11-02 20:10:15,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 193 treesize of output 185 [2022-11-02 20:10:15,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 185 treesize of output 173 [2022-11-02 20:10:16,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:16,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 20:10:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581387793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:16,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:16,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 43 [2022-11-02 20:10:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508535833] [2022-11-02 20:10:16,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:16,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:10:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:10:16,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1551, Unknown=1, NotChecked=80, Total=1806 [2022-11-02 20:10:16,583 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 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-02 20:10:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:17,497 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2022-11-02 20:10:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:10:17,503 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 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) Word has length 38 [2022-11-02 20:10:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:17,504 INFO L225 Difference]: With dead ends: 171 [2022-11-02 20:10:17,504 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 20:10:17,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=2171, Unknown=1, NotChecked=96, Total=2550 [2022-11-02 20:10:17,506 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 117 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:17,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 681 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 501 Invalid, 0 Unknown, 290 Unchecked, 0.4s Time] [2022-11-02 20:10:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 20:10:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2022-11-02 20:10:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 157 states have internal predecessors, (199), 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-02 20:10:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2022-11-02 20:10:17,511 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 38 [2022-11-02 20:10:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:17,511 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2022-11-02 20:10:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 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-02 20:10:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-11-02 20:10:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:10:17,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:17,512 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:17,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:17,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:17,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash -568916534, now seen corresponding path program 1 times [2022-11-02 20:10:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:17,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103727356] [2022-11-02 20:10:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103727356] [2022-11-02 20:10:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103727356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333216688] [2022-11-02 20:10:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:18,324 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:18,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:10:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:18,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:10:18,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:18,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:18,569 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:18,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:18,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:18,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:18,797 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:18,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:10:18,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:18,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:18,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:18,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 71 [2022-11-02 20:10:18,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-02 20:10:18,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:10:19,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-11-02 20:10:19,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:10:19,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:19,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:19,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_958)) .cse1) .cse0)))))) is different from false [2022-11-02 20:10:19,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 452 treesize of output 408 [2022-11-02 20:10:19,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 120 [2022-11-02 20:10:19,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 115 treesize of output 96 [2022-11-02 20:10:19,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 165 treesize of output 152 [2022-11-02 20:10:19,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 250 treesize of output 213 [2022-11-02 20:10:19,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 197 treesize of output 189 [2022-11-02 20:10:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 189 treesize of output 177 [2022-11-02 20:10:19,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 165 [2022-11-02 20:10:19,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 165 treesize of output 157 [2022-11-02 20:10:20,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:20,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:10:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:20,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333216688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:20,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:20,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2022-11-02 20:10:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287012120] [2022-11-02 20:10:20,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:10:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:10:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1460, Unknown=1, NotChecked=78, Total=1722 [2022-11-02 20:10:20,426 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 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-02 20:10:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:21,522 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2022-11-02 20:10:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:10:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 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) Word has length 38 [2022-11-02 20:10:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:21,529 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:10:21,529 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 20:10:21,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=334, Invalid=2119, Unknown=1, NotChecked=96, Total=2550 [2022-11-02 20:10:21,531 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 558 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:21,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 597 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 799 Invalid, 0 Unknown, 549 Unchecked, 0.6s Time] [2022-11-02 20:10:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 20:10:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 147. [2022-11-02 20:10:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.373134328358209) internal successors, (184), 146 states have internal predecessors, (184), 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-02 20:10:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2022-11-02 20:10:21,538 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 38 [2022-11-02 20:10:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:21,538 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2022-11-02 20:10:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 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-02 20:10:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2022-11-02 20:10:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:10:21,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:21,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:21,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:21,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:10:21,760 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1050061463, now seen corresponding path program 1 times [2022-11-02 20:10:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:21,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855619760] [2022-11-02 20:10:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855619760] [2022-11-02 20:10:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855619760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054841143] [2022-11-02 20:10:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:22,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:22,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:10:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:22,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:10:22,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:22,488 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:22,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:22,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:22,743 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:22,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-11-02 20:10:22,770 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:22,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-11-02 20:10:22,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-11-02 20:10:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:10:23,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:23,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:10:23,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-11-02 20:10:23,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_109| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1032) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_109|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_109| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_109|))) is different from false [2022-11-02 20:10:23,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:23,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-02 20:10:23,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:23,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 38 [2022-11-02 20:10:23,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-11-02 20:10:23,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:23,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 52 [2022-11-02 20:10:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-02 20:10:23,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054841143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:23,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:23,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-11-02 20:10:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443958361] [2022-11-02 20:10:23,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:10:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:10:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2022-11-02 20:10:23,755 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:24,475 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2022-11-02 20:10:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:10:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-02 20:10:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:24,480 INFO L225 Difference]: With dead ends: 152 [2022-11-02 20:10:24,480 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 20:10:24,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=346, Invalid=1469, Unknown=3, NotChecked=252, Total=2070 [2022-11-02 20:10:24,482 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 163 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:24,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 585 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 321 Unchecked, 0.2s Time] [2022-11-02 20:10:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 20:10:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-11-02 20:10:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 150 states have internal predecessors, (188), 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-02 20:10:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2022-11-02 20:10:24,486 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 41 [2022-11-02 20:10:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:24,486 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2022-11-02 20:10:24,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.303030303030303) internal successors, (109), 33 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2022-11-02 20:10:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:24,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:24,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:24,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:10:24,700 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044185, now seen corresponding path program 1 times [2022-11-02 20:10:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193395914] [2022-11-02 20:10:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193395914] [2022-11-02 20:10:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193395914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191763490] [2022-11-02 20:10:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:25,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:25,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:25,806 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:25,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:10:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:25,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:10:25,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:26,056 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:10:26,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:26,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:26,333 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:26,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:10:26,363 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:26,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-02 20:10:26,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:26,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 21 [2022-11-02 20:10:26,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:10:26,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:27,145 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1107 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-11-02 20:10:27,183 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1107 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1))) is different from false [2022-11-02 20:10:27,191 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1107 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1107 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2022-11-02 20:10:27,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:27,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-02 20:10:27,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:27,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-11-02 20:10:27,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 5 [2022-11-02 20:10:27,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:27,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 22 [2022-11-02 20:10:27,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:27,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-11-02 20:10:27,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:27,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:27,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:10:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-02 20:10:27,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191763490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:27,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:27,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 16] total 47 [2022-11-02 20:10:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113977218] [2022-11-02 20:10:27,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:27,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:10:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:27,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:10:27,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1751, Unknown=3, NotChecked=264, Total=2256 [2022-11-02 20:10:27,686 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 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-02 20:10:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:28,847 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-11-02 20:10:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:10:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 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 43 [2022-11-02 20:10:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:28,849 INFO L225 Difference]: With dead ends: 161 [2022-11-02 20:10:28,849 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 20:10:28,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=512, Invalid=3037, Unknown=3, NotChecked=354, Total=3906 [2022-11-02 20:10:28,851 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 148 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:28,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 694 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 523 Invalid, 0 Unknown, 345 Unchecked, 0.3s Time] [2022-11-02 20:10:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 20:10:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2022-11-02 20:10:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 156 states have internal predecessors, (195), 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-02 20:10:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-11-02 20:10:28,856 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 43 [2022-11-02 20:10:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:28,856 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-11-02 20:10:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 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-02 20:10:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-11-02 20:10:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:28,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:28,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:28,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:29,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:29,072 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044186, now seen corresponding path program 1 times [2022-11-02 20:10:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:29,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964590262] [2022-11-02 20:10:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964590262] [2022-11-02 20:10:30,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964590262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127604337] [2022-11-02 20:10:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:30,093 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:30,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:10:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:30,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:10:30,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:30,361 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:30,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:30,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:30,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:30,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:30,602 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:30,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:10:30,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:30,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:10:30,642 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:30,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:10:30,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:10:30,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:30,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 21 [2022-11-02 20:10:30,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:30,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:10:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:10:31,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:31,509 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-11-02 20:10:31,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-11-02 20:10:31,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))))) is different from false [2022-11-02 20:10:31,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 42 [2022-11-02 20:10:31,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 32 [2022-11-02 20:10:31,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 55 [2022-11-02 20:10:31,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 81 [2022-11-02 20:10:31,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 62 [2022-11-02 20:10:31,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2022-11-02 20:10:31,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-11-02 20:10:31,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:31,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:31,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 10 [2022-11-02 20:10:31,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:31,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:10:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-02 20:10:32,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127604337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:32,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:32,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 46 [2022-11-02 20:10:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563428695] [2022-11-02 20:10:32,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:32,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 20:10:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 20:10:32,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1670, Unknown=3, NotChecked=258, Total=2162 [2022-11-02 20:10:32,060 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 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-02 20:10:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:33,124 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2022-11-02 20:10:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:10:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 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 43 [2022-11-02 20:10:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:33,125 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:10:33,126 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:10:33,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=441, Invalid=2760, Unknown=3, NotChecked=336, Total=3540 [2022-11-02 20:10:33,127 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 135 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:33,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 743 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 414 Invalid, 0 Unknown, 356 Unchecked, 0.3s Time] [2022-11-02 20:10:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:10:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-11-02 20:10:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 156 states have internal predecessors, (194), 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-02 20:10:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2022-11-02 20:10:33,131 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 43 [2022-11-02 20:10:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:33,132 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2022-11-02 20:10:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 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-02 20:10:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2022-11-02 20:10:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:33,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:33,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:33,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:33,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:33,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1048082290, now seen corresponding path program 2 times [2022-11-02 20:10:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:33,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114486891] [2022-11-02 20:10:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:33,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114486891] [2022-11-02 20:10:34,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114486891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131304549] [2022-11-02 20:10:34,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:10:34,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:34,212 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:34,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:10:34,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:10:34,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:34,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:10:34,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:34,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:34,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-02 20:10:34,603 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:34,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:34,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:34,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-02 20:10:34,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:10:34,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:10:34,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:10:34,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:34,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:34,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:34,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:10:34,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-02 20:10:34,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:10:34,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:10:34,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:10:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:34,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:34,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:10:34,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:10:34,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:10:34,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:10:35,187 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:10:35,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:35,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:35,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2022-11-02 20:10:35,582 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:10:35,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2022-11-02 20:10:35,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 50 [2022-11-02 20:10:35,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-11-02 20:10:35,609 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:10:35,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 12 [2022-11-02 20:10:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:10:35,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131304549] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:35,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:35,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 41 [2022-11-02 20:10:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595041556] [2022-11-02 20:10:35,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:35,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:10:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:35,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:10:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1087, Unknown=53, NotChecked=292, Total=1640 [2022-11-02 20:10:35,689 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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-02 20:10:40,169 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_33|) 0)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_1310) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 20:10:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:40,609 INFO L93 Difference]: Finished difference Result 375 states and 467 transitions. [2022-11-02 20:10:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:10:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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 43 [2022-11-02 20:10:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:40,626 INFO L225 Difference]: With dead ends: 375 [2022-11-02 20:10:40,626 INFO L226 Difference]: Without dead ends: 375 [2022-11-02 20:10:40,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=434, Invalid=1966, Unknown=70, NotChecked=500, Total=2970 [2022-11-02 20:10:40,629 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 439 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1921 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:40,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 889 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 779 Invalid, 0 Unknown, 1921 Unchecked, 0.5s Time] [2022-11-02 20:10:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-02 20:10:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 191. [2022-11-02 20:10:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 190 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2022-11-02 20:10:40,640 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 43 [2022-11-02 20:10:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:40,641 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2022-11-02 20:10:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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-02 20:10:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-11-02 20:10:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:40,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:40,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:40,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:40,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:40,856 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1047774460, now seen corresponding path program 2 times [2022-11-02 20:10:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:40,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586132485] [2022-11-02 20:10:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:41,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586132485] [2022-11-02 20:10:41,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586132485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:41,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275450812] [2022-11-02 20:10:41,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:10:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:41,385 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:41,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:10:41,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:10:41,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:41,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:10:41,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:41,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:41,701 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:10:41,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:41,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:41,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:41,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:41,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:10:41,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:41,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:42,006 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:10:42,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:10:42,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:42,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:42,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-02 20:10:42,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:42,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:42,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:42,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:42,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:10:42,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:10:42,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:10:42,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:10:42,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) is different from false [2022-11-02 20:10:42,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) is different from false [2022-11-02 20:10:42,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:42,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 20:10:42,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:42,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 121 [2022-11-02 20:10:42,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 98 [2022-11-02 20:10:42,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 94 [2022-11-02 20:10:42,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:42,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-02 20:10:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-02 20:10:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275450812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:43,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-11-02 20:10:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632836352] [2022-11-02 20:10:43,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:10:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:10:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1061, Unknown=12, NotChecked=438, Total=1722 [2022-11-02 20:10:43,423 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:45,318 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 20:10:45,359 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1422 Int) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1422)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-11-02 20:10:45,370 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0)))) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2022-11-02 20:10:45,383 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-11-02 20:10:45,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_1432 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_36| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1429) |v_ULTIMATE.start_main_~t~0#1.base_36| v_ArrVal_1432) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_36|) 0))))) is different from false [2022-11-02 20:10:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:45,631 INFO L93 Difference]: Finished difference Result 481 states and 608 transitions. [2022-11-02 20:10:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:10:45,632 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-02 20:10:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:45,633 INFO L225 Difference]: With dead ends: 481 [2022-11-02 20:10:45,633 INFO L226 Difference]: Without dead ends: 481 [2022-11-02 20:10:45,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=385, Invalid=2070, Unknown=39, NotChecked=1166, Total=3660 [2022-11-02 20:10:45,635 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 426 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1174 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:45,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 799 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 504 Invalid, 0 Unknown, 1174 Unchecked, 0.4s Time] [2022-11-02 20:10:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-02 20:10:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 213. [2022-11-02 20:10:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 200 states have (on average 1.31) internal successors, (262), 212 states have internal predecessors, (262), 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-02 20:10:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2022-11-02 20:10:45,642 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 43 [2022-11-02 20:10:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:45,642 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2022-11-02 20:10:45,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2022-11-02 20:10:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:45,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:45,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:45,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:45,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:10:45,868 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:45,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1554014930, now seen corresponding path program 1 times [2022-11-02 20:10:45,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:45,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700980331] [2022-11-02 20:10:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:46,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700980331] [2022-11-02 20:10:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700980331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236351783] [2022-11-02 20:10:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:46,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:46,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:46,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:46,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:10:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:46,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:10:46,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:46,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:46,765 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:10:46,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:46,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:10:46,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:46,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:46,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:10:46,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:47,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:47,059 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:10:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:10:47,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:47,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:47,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-02 20:10:47,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:47,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:47,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:47,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:47,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:10:47,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:10:47,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 20:10:47,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 20:10:47,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) is different from false [2022-11-02 20:10:47,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-11-02 20:10:48,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:48,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 20:10:48,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:48,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 121 [2022-11-02 20:10:48,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 98 [2022-11-02 20:10:48,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 94 [2022-11-02 20:10:48,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:48,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-02 20:10:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-02 20:10:54,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236351783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:54,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:54,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-11-02 20:10:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39186230] [2022-11-02 20:10:54,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:54,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:10:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:10:54,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1061, Unknown=12, NotChecked=438, Total=1722 [2022-11-02 20:10:54,148 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:56,382 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 20:10:56,473 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1546 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1546)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2022-11-02 20:10:56,552 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1554 (Array Int Int))) (= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)) (= 2 (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 20:10:56,579 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:10:56,602 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| Int) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1550) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) 0)))) (forall ((v_ArrVal_1554 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:10:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:56,864 INFO L93 Difference]: Finished difference Result 529 states and 666 transitions. [2022-11-02 20:10:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-02 20:10:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-02 20:10:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:56,866 INFO L225 Difference]: With dead ends: 529 [2022-11-02 20:10:56,866 INFO L226 Difference]: Without dead ends: 529 [2022-11-02 20:10:56,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=521, Invalid=2459, Unknown=34, NotChecked=1276, Total=4290 [2022-11-02 20:10:56,868 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 622 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1791 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:56,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 932 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1053 Invalid, 0 Unknown, 1791 Unchecked, 0.7s Time] [2022-11-02 20:10:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-11-02 20:10:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 248. [2022-11-02 20:10:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 235 states have (on average 1.297872340425532) internal successors, (305), 247 states have internal predecessors, (305), 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-02 20:10:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 305 transitions. [2022-11-02 20:10:56,876 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 305 transitions. Word has length 43 [2022-11-02 20:10:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:56,876 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 305 transitions. [2022-11-02 20:10:56,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 305 transitions. [2022-11-02 20:10:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:10:56,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:56,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:56,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:57,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:10:57,096 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:10:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1553707100, now seen corresponding path program 1 times [2022-11-02 20:10:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:57,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695002213] [2022-11-02 20:10:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:57,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695002213] [2022-11-02 20:10:57,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695002213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:57,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877374745] [2022-11-02 20:10:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:57,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:57,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:57,868 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:57,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:10:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:58,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:10:58,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:58,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,236 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:10:58,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:10:58,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:58,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:10:58,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,524 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:10:58,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:10:58,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:58,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-02 20:10:58,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:10:58,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:58,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:58,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:10:58,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:10:58,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:10:58,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-02 20:10:58,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)))) is different from false [2022-11-02 20:10:59,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:59,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 44 [2022-11-02 20:10:59,277 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:10:59,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 140 treesize of output 129 [2022-11-02 20:10:59,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-02 20:10:59,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 94 [2022-11-02 20:10:59,321 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-02 20:10:59,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-11-02 20:10:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-02 20:10:59,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877374745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:59,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:59,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 45 [2022-11-02 20:10:59,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720238362] [2022-11-02 20:10:59,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:59,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:10:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:59,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:10:59,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1273, Unknown=25, NotChecked=400, Total=1980 [2022-11-02 20:10:59,431 INFO L87 Difference]: Start difference. First operand 248 states and 305 transitions. Second operand has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:00,069 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1671 Int) (v_ArrVal_1675 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_1671)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-11-02 20:11:00,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))))) is different from false [2022-11-02 20:11:00,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1675 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1675) |v_ULTIMATE.start_main_~t~0#1.base_40| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) is different from false [2022-11-02 20:11:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:00,851 INFO L93 Difference]: Finished difference Result 564 states and 709 transitions. [2022-11-02 20:11:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:11:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-02 20:11:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:00,853 INFO L225 Difference]: With dead ends: 564 [2022-11-02 20:11:00,854 INFO L226 Difference]: Without dead ends: 564 [2022-11-02 20:11:00,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=504, Invalid=2039, Unknown=39, NotChecked=840, Total=3422 [2022-11-02 20:11:00,855 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 397 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1475 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:00,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1327 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1345 Invalid, 0 Unknown, 1475 Unchecked, 0.8s Time] [2022-11-02 20:11:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-02 20:11:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 298. [2022-11-02 20:11:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 285 states have (on average 1.2842105263157895) internal successors, (366), 297 states have internal predecessors, (366), 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-02 20:11:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 366 transitions. [2022-11-02 20:11:00,866 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 366 transitions. Word has length 43 [2022-11-02 20:11:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:00,867 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 366 transitions. [2022-11-02 20:11:00,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.4) internal successors, (108), 45 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 366 transitions. [2022-11-02 20:11:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:11:00,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:00,868 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:00,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:01,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:11:01,081 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1811872538, now seen corresponding path program 1 times [2022-11-02 20:11:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:01,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329569051] [2022-11-02 20:11:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329569051] [2022-11-02 20:11:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329569051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274511286] [2022-11-02 20:11:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:01,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:01,168 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:01,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:11:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:01,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:11:01,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:01,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:01,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274511286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:01,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:01,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-02 20:11:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887835935] [2022-11-02 20:11:01,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:01,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:01,478 INFO L87 Difference]: Start difference. First operand 298 states and 366 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-02 20:11:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:01,601 INFO L93 Difference]: Finished difference Result 648 states and 722 transitions. [2022-11-02 20:11:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:11:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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 43 [2022-11-02 20:11:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:01,604 INFO L225 Difference]: With dead ends: 648 [2022-11-02 20:11:01,604 INFO L226 Difference]: Without dead ends: 648 [2022-11-02 20:11:01,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:11:01,611 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 389 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:01,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 529 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-11-02 20:11:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 383. [2022-11-02 20:11:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 370 states have (on average 1.218918918918919) internal successors, (451), 382 states have internal predecessors, (451), 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-02 20:11:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 451 transitions. [2022-11-02 20:11:01,623 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 451 transitions. Word has length 43 [2022-11-02 20:11:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:01,623 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 451 transitions. [2022-11-02 20:11:01,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-02 20:11:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 451 transitions. [2022-11-02 20:11:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:11:01,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:01,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:01,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:01,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:11:01,848 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -417498254, now seen corresponding path program 2 times [2022-11-02 20:11:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:01,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213000938] [2022-11-02 20:11:01,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:01,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213000938] [2022-11-02 20:11:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213000938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590533835] [2022-11-02 20:11:02,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:02,412 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:02,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:11:02,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:02,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:02,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:11:02,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:02,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:02,750 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:02,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:02,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:02,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:02,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:02,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-11-02 20:11:02,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:02,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:02,991 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:02,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:03,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:03,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:11:03,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-02 20:11:03,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:03,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:03,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:11:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:03,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:03,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1907 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:11:03,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1907 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 20:11:03,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1907 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:11:03,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 20:11:03,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)))) is different from false [2022-11-02 20:11:03,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:03,431 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:11:03,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:03,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:03,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 20:11:03,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:03,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-11-02 20:11:03,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 102 [2022-11-02 20:11:03,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 94 [2022-11-02 20:11:03,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:03,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:11:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-02 20:11:03,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590533835] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:03,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:03,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-11-02 20:11:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134972401] [2022-11-02 20:11:03,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:03,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:11:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:11:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1039, Unknown=42, NotChecked=438, Total=1722 [2022-11-02 20:11:03,864 INFO L87 Difference]: Start difference. First operand 383 states and 451 transitions. Second operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:07,418 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1907) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 20:11:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:07,910 INFO L93 Difference]: Finished difference Result 719 states and 870 transitions. [2022-11-02 20:11:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 20:11:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-02 20:11:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:07,920 INFO L225 Difference]: With dead ends: 719 [2022-11-02 20:11:07,920 INFO L226 Difference]: Without dead ends: 719 [2022-11-02 20:11:07,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=489, Invalid=2217, Unknown=78, NotChecked=756, Total=3540 [2022-11-02 20:11:07,921 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 443 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1618 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:07,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1112 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1173 Invalid, 0 Unknown, 1618 Unchecked, 0.7s Time] [2022-11-02 20:11:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-11-02 20:11:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 392. [2022-11-02 20:11:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 379 states have (on average 1.2163588390501319) internal successors, (461), 391 states have internal predecessors, (461), 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-02 20:11:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 461 transitions. [2022-11-02 20:11:07,934 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 461 transitions. Word has length 43 [2022-11-02 20:11:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:07,935 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 461 transitions. [2022-11-02 20:11:07,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 42 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 461 transitions. [2022-11-02 20:11:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:11:07,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:07,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:07,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:08,153 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1278944328, now seen corresponding path program 1 times [2022-11-02 20:11:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:08,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156218454] [2022-11-02 20:11:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:09,014 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-02 20:11:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:09,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156218454] [2022-11-02 20:11:09,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156218454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:09,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816402562] [2022-11-02 20:11:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:09,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:09,016 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:09,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 20:11:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:09,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:11:09,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:09,314 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:09,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:09,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:09,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:09,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:11:09,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:09,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:09,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:09,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-11-02 20:11:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:11:09,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:09,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:09,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-11-02 20:11:09,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:09,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-02 20:11:10,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:10,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:11:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:11:10,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816402562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:10,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:10,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 44 [2022-11-02 20:11:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073016775] [2022-11-02 20:11:10,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:10,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:11:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:11:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1752, Unknown=9, NotChecked=0, Total=1980 [2022-11-02 20:11:10,406 INFO L87 Difference]: Start difference. First operand 392 states and 461 transitions. Second operand has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 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-02 20:11:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:12,216 INFO L93 Difference]: Finished difference Result 433 states and 500 transitions. [2022-11-02 20:11:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:11:12,217 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 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 45 [2022-11-02 20:11:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:12,219 INFO L225 Difference]: With dead ends: 433 [2022-11-02 20:11:12,219 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 20:11:12,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=806, Invalid=4015, Unknown=9, NotChecked=0, Total=4830 [2022-11-02 20:11:12,221 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1177 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:12,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 814 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1158 Invalid, 0 Unknown, 299 Unchecked, 0.7s Time] [2022-11-02 20:11:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 20:11:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 397. [2022-11-02 20:11:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 384 states have (on average 1.21875) internal successors, (468), 396 states have internal predecessors, (468), 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-02 20:11:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 468 transitions. [2022-11-02 20:11:12,229 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 468 transitions. Word has length 45 [2022-11-02 20:11:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:12,229 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 468 transitions. [2022-11-02 20:11:12,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 states have internal predecessors, (111), 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-02 20:11:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 468 transitions. [2022-11-02 20:11:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:11:12,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:12,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:12,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:12,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-02 20:11:12,456 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1278944379, now seen corresponding path program 1 times [2022-11-02 20:11:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:12,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879165767] [2022-11-02 20:11:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:11:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879165767] [2022-11-02 20:11:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879165767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:12,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:11:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667188966] [2022-11-02 20:11:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:11:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:11:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:11:12,507 INFO L87 Difference]: Start difference. First operand 397 states and 468 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02 20:11:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:12,564 INFO L93 Difference]: Finished difference Result 396 states and 466 transitions. [2022-11-02 20:11:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:11:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 45 [2022-11-02 20:11:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:12,567 INFO L225 Difference]: With dead ends: 396 [2022-11-02 20:11:12,567 INFO L226 Difference]: Without dead ends: 396 [2022-11-02 20:11:12,567 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-02 20:11:12,568 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:12,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-02 20:11:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-11-02 20:11:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 384 states have (on average 1.2135416666666667) internal successors, (466), 395 states have internal predecessors, (466), 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-02 20:11:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 466 transitions. [2022-11-02 20:11:12,576 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 466 transitions. Word has length 45 [2022-11-02 20:11:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:12,576 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 466 transitions. [2022-11-02 20:11:12,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02 20:11:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 466 transitions. [2022-11-02 20:11:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:11:12,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:12,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:12,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:11:12,578 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926888, now seen corresponding path program 2 times [2022-11-02 20:11:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321394079] [2022-11-02 20:11:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321394079] [2022-11-02 20:11:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321394079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248864408] [2022-11-02 20:11:13,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:13,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:13,240 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:13,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 20:11:13,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:13,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:13,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:11:13,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:13,549 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:13,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:13,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:13,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:13,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:13,695 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:13,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:13,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:11:13,882 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:13,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-11-02 20:11:13,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-11-02 20:11:13,961 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:13,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2022-11-02 20:11:14,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:11:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:14,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:14,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-02 20:11:14,206 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-02 20:11:14,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-11-02 20:11:14,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:14,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:11:14,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:14,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 85 [2022-11-02 20:11:14,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 64 [2022-11-02 20:11:14,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-02 20:11:14,495 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:11:14,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:14,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:11:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:11:14,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248864408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:14,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:14,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 39 [2022-11-02 20:11:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015666104] [2022-11-02 20:11:14,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:14,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:11:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:11:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1211, Unknown=19, NotChecked=146, Total=1560 [2022-11-02 20:11:14,873 INFO L87 Difference]: Start difference. First operand 396 states and 466 transitions. Second operand has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:16,060 INFO L93 Difference]: Finished difference Result 499 states and 591 transitions. [2022-11-02 20:11:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:11:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:11:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:16,063 INFO L225 Difference]: With dead ends: 499 [2022-11-02 20:11:16,063 INFO L226 Difference]: Without dead ends: 499 [2022-11-02 20:11:16,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=470, Invalid=2274, Unknown=20, NotChecked=206, Total=2970 [2022-11-02 20:11:16,064 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 676 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1017 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:16,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 824 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 721 Invalid, 0 Unknown, 1017 Unchecked, 0.5s Time] [2022-11-02 20:11:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-02 20:11:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 417. [2022-11-02 20:11:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 405 states have (on average 1.2098765432098766) internal successors, (490), 416 states have internal predecessors, (490), 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-02 20:11:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 490 transitions. [2022-11-02 20:11:16,072 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 490 transitions. Word has length 45 [2022-11-02 20:11:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:16,073 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 490 transitions. [2022-11-02 20:11:16,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 490 transitions. [2022-11-02 20:11:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:11:16,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:16,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:16,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:16,288 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926889, now seen corresponding path program 2 times [2022-11-02 20:11:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:16,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81597603] [2022-11-02 20:11:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:17,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81597603] [2022-11-02 20:11:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81597603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188833182] [2022-11-02 20:11:17,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:17,152 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:17,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-02 20:11:17,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:17,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-02 20:11:17,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:17,509 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:17,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:17,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:17,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:17,715 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:17,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-02 20:11:17,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:17,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:17,777 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:17,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:11:17,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:11:17,797 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:17,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-02 20:11:17,869 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:17,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:17,941 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:17,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:11:17,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:11:17,968 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:11:17,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2022-11-02 20:11:18,207 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:18,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:11:18,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:11:18,235 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:18,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 61 [2022-11-02 20:11:18,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-11-02 20:11:18,375 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:18,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 83 [2022-11-02 20:11:18,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:18,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:18,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 14 [2022-11-02 20:11:18,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:18,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 13 [2022-11-02 20:11:18,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:18,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:11:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:18,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:18,886 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)) (let ((.cse0 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))))) is different from false [2022-11-02 20:11:18,987 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))))) is different from false [2022-11-02 20:11:19,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse1 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2256) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))))) is different from false [2022-11-02 20:11:19,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 85 [2022-11-02 20:11:19,133 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2256 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|)) |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|)))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int)) (or (not (<= v_prenex_30 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 v_prenex_30)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_32) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_31) |c_ULTIMATE.start_main_~a~0#1.base|) (+ v_prenex_30 8))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_174| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_174| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2251) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2257) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_174|)) (+ 9 |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_174|))))) is different from false [2022-11-02 20:11:19,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:11:20,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 124 [2022-11-02 20:11:20,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 114 [2022-11-02 20:11:20,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 342 treesize of output 342 [2022-11-02 20:11:20,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 307 treesize of output 299 [2022-11-02 20:11:20,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 299 treesize of output 283 [2022-11-02 20:11:20,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 283 treesize of output 275 [2022-11-02 20:11:20,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 330 [2022-11-02 20:11:20,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 410 treesize of output 403 [2022-11-02 20:11:20,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 387 treesize of output 371 [2022-11-02 20:11:20,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 371 treesize of output 355 [2022-11-02 20:11:20,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:20,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 392 treesize of output 356 [2022-11-02 20:11:22,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:22,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 20:11:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:11:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188833182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:22,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 49 [2022-11-02 20:11:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247186928] [2022-11-02 20:11:22,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:22,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:11:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:11:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1851, Unknown=21, NotChecked=364, Total=2450 [2022-11-02 20:11:22,648 INFO L87 Difference]: Start difference. First operand 417 states and 490 transitions. Second operand has 50 states, 49 states have (on average 2.63265306122449) internal successors, (129), 50 states have internal predecessors, (129), 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-02 20:11:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:25,255 INFO L93 Difference]: Finished difference Result 444 states and 519 transitions. [2022-11-02 20:11:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:11:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.63265306122449) internal successors, (129), 50 states have internal predecessors, (129), 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 45 [2022-11-02 20:11:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:25,256 INFO L225 Difference]: With dead ends: 444 [2022-11-02 20:11:25,256 INFO L226 Difference]: Without dead ends: 444 [2022-11-02 20:11:25,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=410, Invalid=3125, Unknown=21, NotChecked=476, Total=4032 [2022-11-02 20:11:25,258 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 110 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:25,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 949 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 552 Invalid, 0 Unknown, 759 Unchecked, 0.4s Time] [2022-11-02 20:11:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-02 20:11:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 422. [2022-11-02 20:11:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 410 states have (on average 1.2097560975609756) internal successors, (496), 421 states have internal predecessors, (496), 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-02 20:11:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 496 transitions. [2022-11-02 20:11:25,266 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 496 transitions. Word has length 45 [2022-11-02 20:11:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:25,266 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 496 transitions. [2022-11-02 20:11:25,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.63265306122449) internal successors, (129), 50 states have internal predecessors, (129), 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-02 20:11:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 496 transitions. [2022-11-02 20:11:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:11:25,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:25,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:25,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:25,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:25,481 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1240253185, now seen corresponding path program 1 times [2022-11-02 20:11:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:25,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644041721] [2022-11-02 20:11:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644041721] [2022-11-02 20:11:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644041721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:26,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643008836] [2022-11-02 20:11:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:26,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:26,268 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:26,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-02 20:11:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:11:26,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:26,624 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:11:26,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:26,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:26,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:26,895 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:26,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:11:26,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:11:26,912 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:26,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:11:26,998 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:26,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:11:27,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:27,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:27,070 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 20:11:27,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:11:27,156 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:11:27,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-11-02 20:11:27,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:27,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:27,454 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:27,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2022-11-02 20:11:27,485 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:27,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-02 20:11:27,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:11:27,576 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:27,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-02 20:11:27,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:11:27,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:27,949 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:11:27,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 71 treesize of output 26 [2022-11-02 20:11:27,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:27,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:11:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:27,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:28,226 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))))) (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int) (v_ArrVal_2381 (Array Int Int))) (or (let ((.cse0 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|))))) is different from false [2022-11-02 20:11:28,312 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int)) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|)))) (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int) (v_ArrVal_2381 (Array Int Int))) (or (let ((.cse0 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|))))) is different from false [2022-11-02 20:11:28,333 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int) (v_ArrVal_2381 (Array Int Int))) (or (let ((.cse1 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2381) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|)))) (forall ((v_ArrVal_2380 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_181| Int)) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2380) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_181|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_181| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_181|)))))) is different from false [2022-11-02 20:11:28,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:28,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 85 [2022-11-02 20:11:28,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:28,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:11:29,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-11-02 20:11:29,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 69 [2022-11-02 20:11:29,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 46 [2022-11-02 20:11:29,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-11-02 20:11:29,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-11-02 20:11:29,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:29,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:11:29,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:11:29,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:29,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:29,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:11:29,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-11-02 20:11:30,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:30,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 236 [2022-11-02 20:11:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 20:11:34,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643008836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:34,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:34,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 48 [2022-11-02 20:11:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591984453] [2022-11-02 20:11:34,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:34,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-02 20:11:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-02 20:11:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1861, Unknown=19, NotChecked=270, Total=2352 [2022-11-02 20:11:34,128 INFO L87 Difference]: Start difference. First operand 422 states and 496 transitions. Second operand has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 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-02 20:11:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:36,297 INFO L93 Difference]: Finished difference Result 455 states and 531 transitions. [2022-11-02 20:11:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:11:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 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 45 [2022-11-02 20:11:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:36,299 INFO L225 Difference]: With dead ends: 455 [2022-11-02 20:11:36,299 INFO L226 Difference]: Without dead ends: 455 [2022-11-02 20:11:36,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=513, Invalid=3640, Unknown=19, NotChecked=384, Total=4556 [2022-11-02 20:11:36,300 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 348 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:36,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1249 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 969 Invalid, 0 Unknown, 1163 Unchecked, 0.6s Time] [2022-11-02 20:11:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-02 20:11:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 430. [2022-11-02 20:11:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 418 states have (on average 1.2129186602870814) internal successors, (507), 429 states have internal predecessors, (507), 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-02 20:11:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 507 transitions. [2022-11-02 20:11:36,308 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 507 transitions. Word has length 45 [2022-11-02 20:11:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:36,308 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 507 transitions. [2022-11-02 20:11:36,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 49 states have internal predecessors, (129), 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-02 20:11:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 507 transitions. [2022-11-02 20:11:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:11:36,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:36,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:36,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:36,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-02 20:11:36,524 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:36,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 992568690, now seen corresponding path program 1 times [2022-11-02 20:11:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:36,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222078384] [2022-11-02 20:11:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:36,962 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-02 20:11:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:36,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222078384] [2022-11-02 20:11:36,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222078384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:36,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943220763] [2022-11-02 20:11:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:36,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:36,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-02 20:11:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:37,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:11:37,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:37,276 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:37,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:37,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:37,402 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:37,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:11:37,420 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:37,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:37,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 21 [2022-11-02 20:11:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:11:37,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:37,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2455 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2455) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:11:37,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2455 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2455) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:11:37,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2455 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2455) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:11:37,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-11-02 20:11:37,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-02 20:11:37,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:37,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 74 [2022-11-02 20:11:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-02 20:11:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943220763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:38,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:38,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 34 [2022-11-02 20:11:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983035246] [2022-11-02 20:11:38,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:11:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:11:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=845, Unknown=3, NotChecked=186, Total=1190 [2022-11-02 20:11:38,102 INFO L87 Difference]: Start difference. First operand 430 states and 507 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:39,163 INFO L93 Difference]: Finished difference Result 462 states and 536 transitions. [2022-11-02 20:11:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:11:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 20:11:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:39,166 INFO L225 Difference]: With dead ends: 462 [2022-11-02 20:11:39,167 INFO L226 Difference]: Without dead ends: 462 [2022-11-02 20:11:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=540, Invalid=2225, Unknown=3, NotChecked=312, Total=3080 [2022-11-02 20:11:39,167 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 584 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 685 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 854 Invalid, 0 Unknown, 460 Unchecked, 0.5s Time] [2022-11-02 20:11:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-02 20:11:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 424. [2022-11-02 20:11:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 412 states have (on average 1.2135922330097086) internal successors, (500), 423 states have internal predecessors, (500), 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-02 20:11:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 500 transitions. [2022-11-02 20:11:39,175 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 500 transitions. Word has length 46 [2022-11-02 20:11:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:39,175 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 500 transitions. [2022-11-02 20:11:39,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 500 transitions. [2022-11-02 20:11:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:11:39,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:39,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:39,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:39,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-02 20:11:39,404 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1084740117, now seen corresponding path program 2 times [2022-11-02 20:11:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748917567] [2022-11-02 20:11:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748917567] [2022-11-02 20:11:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748917567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920045698] [2022-11-02 20:11:39,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:39,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:39,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:39,899 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:39,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-02 20:11:40,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:40,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:40,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 20:11:40,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:40,244 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:11:40,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:11:40,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:40,494 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:40,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-11-02 20:11:40,569 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:40,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-11-02 20:11:40,602 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 20:11:40,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:11:40,681 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:11:40,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2022-11-02 20:11:40,932 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:40,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 66 [2022-11-02 20:11:40,972 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:40,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 66 [2022-11-02 20:11:41,160 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-02 20:11:41,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 31 [2022-11-02 20:11:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:41,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:41,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2574 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2574) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:11:41,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2574 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2574) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))))) is different from false [2022-11-02 20:11:41,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_201| Int) (v_ArrVal_2574 (Array Int Int))) (or (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_201|) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2574) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_201|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_201| 1) 0))) is different from false [2022-11-02 20:11:41,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_201| Int) (v_ArrVal_2574 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2574) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_201|)) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_201|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_201| 1) 0))) is different from false [2022-11-02 20:11:41,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:41,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:11:41,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:41,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-02 20:11:41,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:41,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 173 treesize of output 166 [2022-11-02 20:11:41,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:41,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 133 [2022-11-02 20:11:41,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 102 [2022-11-02 20:11:42,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:42,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 222 [2022-11-02 20:11:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:11:48,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920045698] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:48,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 46 [2022-11-02 20:11:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123486104] [2022-11-02 20:11:48,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:11:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:48,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:11:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=16, NotChecked=332, Total=2070 [2022-11-02 20:11:48,585 INFO L87 Difference]: Start difference. First operand 424 states and 500 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 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-02 20:11:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:50,665 INFO L93 Difference]: Finished difference Result 580 states and 678 transitions. [2022-11-02 20:11:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 20:11:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 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 46 [2022-11-02 20:11:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:50,668 INFO L225 Difference]: With dead ends: 580 [2022-11-02 20:11:50,668 INFO L226 Difference]: Without dead ends: 579 [2022-11-02 20:11:50,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=537, Invalid=4573, Unknown=18, NotChecked=572, Total=5700 [2022-11-02 20:11:50,669 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 307 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:50,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1344 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 627 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-11-02 20:11:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-11-02 20:11:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 446. [2022-11-02 20:11:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 434 states have (on average 1.207373271889401) internal successors, (524), 445 states have internal predecessors, (524), 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-02 20:11:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 524 transitions. [2022-11-02 20:11:50,677 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 524 transitions. Word has length 46 [2022-11-02 20:11:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:50,677 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 524 transitions. [2022-11-02 20:11:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 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-02 20:11:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 524 transitions. [2022-11-02 20:11:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:11:50,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:50,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:50,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:50,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-02 20:11:50,904 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash -756231861, now seen corresponding path program 1 times [2022-11-02 20:11:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:50,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713430948] [2022-11-02 20:11:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713430948] [2022-11-02 20:11:51,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713430948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748661335] [2022-11-02 20:11:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:51,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:51,448 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:51,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-02 20:11:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:51,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:11:51,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:51,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:51,882 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:11:51,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:51,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:51,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:51,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:52,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:11:52,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:52,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:52,195 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:11:52,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:11:52,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:52,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:11:52,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-02 20:11:52,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:52,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:52,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:11:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:52,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:52,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 20:11:52,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 20:11:52,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 20:11:52,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 20:11:52,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-02 20:11:52,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-02 20:11:52,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:52,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 20:11:52,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:52,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 63 [2022-11-02 20:11:52,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-11-02 20:11:52,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-11-02 20:11:53,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:53,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-02 20:11:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-02 20:11:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748661335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:54,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:54,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2022-11-02 20:11:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193709129] [2022-11-02 20:11:54,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:54,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:11:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:11:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1352, Unknown=12, NotChecked=486, Total=2070 [2022-11-02 20:11:54,024 INFO L87 Difference]: Start difference. First operand 446 states and 524 transitions. Second operand has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:55,164 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (forall ((v_ArrVal_2691 Int) (v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_2691)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2022-11-02 20:11:55,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse0 v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2022-11-02 20:11:55,555 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2022-11-02 20:11:55,635 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_65|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2695) |v_ULTIMATE.start_main_~t~0#1.base_65| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) (forall ((v_ArrVal_2698 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-02 20:11:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:56,443 INFO L93 Difference]: Finished difference Result 800 states and 942 transitions. [2022-11-02 20:11:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-02 20:11:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 20:11:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:56,445 INFO L225 Difference]: With dead ends: 800 [2022-11-02 20:11:56,445 INFO L226 Difference]: Without dead ends: 800 [2022-11-02 20:11:56,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=809, Invalid=3630, Unknown=23, NotChecked=1390, Total=5852 [2022-11-02 20:11:56,445 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 603 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1694 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:56,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1035 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1062 Invalid, 0 Unknown, 1694 Unchecked, 0.6s Time] [2022-11-02 20:11:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-02 20:11:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 531. [2022-11-02 20:11:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 519 states have (on average 1.188824662813102) internal successors, (617), 530 states have internal predecessors, (617), 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-02 20:11:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 617 transitions. [2022-11-02 20:11:56,455 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 617 transitions. Word has length 46 [2022-11-02 20:11:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 617 transitions. [2022-11-02 20:11:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 617 transitions. [2022-11-02 20:11:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:11:56,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:56,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:56,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:56,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-02 20:11:56,672 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2022-11-02 20:11:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 375777400, now seen corresponding path program 1 times [2022-11-02 20:11:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:56,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861381623] [2022-11-02 20:11:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,433 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-02 20:11:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861381623] [2022-11-02 20:11:57,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861381623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261680184] [2022-11-02 20:11:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:57,435 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:57,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba15fcc5-d69a-4e4f-b94f-768f18b50e83/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 20:11:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:11:57,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:57,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:11:58,215 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:58,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2022-11-02 20:11:58,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:58,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-11-02 20:11:58,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:58,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 29 [2022-11-02 20:11:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:11:58,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:59,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2776 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2776) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-02 20:11:59,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2776 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2776) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-02 20:11:59,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2776 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2776) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-02 20:11:59,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:59,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 31 [2022-11-02 20:11:59,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:59,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 53 [2022-11-02 20:11:59,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:12:41,434 WARN L234 SmtUtils]: Spent 29.67s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:13:07,761 WARN L234 SmtUtils]: Spent 26.16s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)