./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:05:40,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:05:40,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:05:40,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:05:40,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:05:40,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:05:40,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:05:40,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:05:40,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:05:40,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:05:40,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:05:40,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:05:40,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:05:40,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:05:40,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:05:40,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:05:40,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:05:40,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:05:40,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:05:40,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:05:40,151 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:05:40,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:05:40,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:05:40,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:05:40,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:05:40,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:05:40,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:05:40,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:05:40,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:05:40,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:05:40,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:05:40,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:05:40,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:05:40,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:05:40,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:05:40,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:05:40,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:05:40,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:05:40,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:05:40,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:05:40,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:05:40,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:05:40,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:05:40,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:05:40,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:05:40,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:05:40,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:05:40,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:05:40,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:05:40,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:05:40,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:05:40,194 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:05:40,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:05:40,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:05:40,195 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:05:40,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:05:40,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:05:40,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:05:40,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:05:40,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:05:40,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:05:40,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:05:40,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:05:40,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:05:40,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:05:40,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:05:40,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:05:40,198 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 [2022-07-23 06:05:40,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:05:40,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:05:40,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:05:40,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:05:40,449 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:05:40,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-23 06:05:40,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8a56cb9/f5cd09d1e1bd47ad9aa7cb2cd853bf7b/FLAG8893bb059 [2022-07-23 06:05:40,941 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:05:40,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-23 06:05:40,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8a56cb9/f5cd09d1e1bd47ad9aa7cb2cd853bf7b/FLAG8893bb059 [2022-07-23 06:05:40,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8a56cb9/f5cd09d1e1bd47ad9aa7cb2cd853bf7b [2022-07-23 06:05:40,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:05:40,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:05:40,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:05:40,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:05:40,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:05:40,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:05:40" (1/1) ... [2022-07-23 06:05:40,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2360c310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:40, skipping insertion in model container [2022-07-23 06:05:40,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:05:40" (1/1) ... [2022-07-23 06:05:40,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:05:40,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:05:41,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:05:41,144 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:05:41,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:05:41,175 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:05:41,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41 WrapperNode [2022-07-23 06:05:41,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:05:41,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:05:41,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:05:41,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:05:41,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,233 INFO L137 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-07-23 06:05:41,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:05:41,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:05:41,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:05:41,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:05:41,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:05:41,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:05:41,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:05:41,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:05:41,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (1/1) ... [2022-07-23 06:05:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:05:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:41,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:05:41,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:05:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:05:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:05:41,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:05:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:05:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:05:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:05:41,468 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:05:41,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:05:41,658 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:05:41,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:05:41,679 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 06:05:41,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:05:41 BoogieIcfgContainer [2022-07-23 06:05:41,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:05:41,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:05:41,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:05:41,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:05:41,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:05:40" (1/3) ... [2022-07-23 06:05:41,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fabe4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:05:41, skipping insertion in model container [2022-07-23 06:05:41,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:05:41" (2/3) ... [2022-07-23 06:05:41,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fabe4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:05:41, skipping insertion in model container [2022-07-23 06:05:41,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:05:41" (3/3) ... [2022-07-23 06:05:41,688 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2022-07-23 06:05:41,699 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:05:41,715 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-23 06:05:41,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:05:41,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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ed731c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8761f92 [2022-07-23 06:05:41,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-23 06:05:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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-07-23 06:05:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:05:41,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:41,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:05:41,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-07-23 06:05:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:41,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226506780] [2022-07-23 06:05:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226506780] [2022-07-23 06:05:41,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226506780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:41,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:41,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:05:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323604799] [2022-07-23 06:05:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:41,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:05:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:05:42,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:05:42,014 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07-23 06:05:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,107 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-23 06:05:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:05:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-23 06:05:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,115 INFO L225 Difference]: With dead ends: 69 [2022-07-23 06:05:42,116 INFO L226 Difference]: Without dead ends: 65 [2022-07-23 06:05:42,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:42,121 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-23 06:05:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-07-23 06:05:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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-07-23 06:05:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-23 06:05:42,149 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 5 [2022-07-23 06:05:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,149 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-23 06:05:42,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07-23 06:05:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-07-23 06:05:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 06:05:42,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:05:42,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811544, now seen corresponding path program 1 times [2022-07-23 06:05:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102606875] [2022-07-23 06:05:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102606875] [2022-07-23 06:05:42,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102606875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:42,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:42,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:05:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915148205] [2022-07-23 06:05:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:42,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:05:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:05:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:42,248 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-07-23 06:05:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,332 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-23 06:05:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:05:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-23 06:05:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,333 INFO L225 Difference]: With dead ends: 70 [2022-07-23 06:05:42,333 INFO L226 Difference]: Without dead ends: 70 [2022-07-23 06:05:42,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-07-23 06:05:42,334 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-23 06:05:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2022-07-23 06:05:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.5) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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-07-23 06:05:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-23 06:05:42,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-07-23 06:05:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,339 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-23 06:05:42,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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-07-23 06:05:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-23 06:05:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:05:42,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:05:42,340 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -489510905, now seen corresponding path program 1 times [2022-07-23 06:05:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260481179] [2022-07-23 06:05:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260481179] [2022-07-23 06:05:42,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260481179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:42,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:42,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:05:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941715634] [2022-07-23 06:05:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:42,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:05:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:05:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:42,375 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,401 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-23 06:05:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:05:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:05:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,403 INFO L225 Difference]: With dead ends: 75 [2022-07-23 06:05:42,403 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 06:05:42,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-07-23 06:05:42,404 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 06:05:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2022-07-23 06:05:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 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-07-23 06:05:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-23 06:05:42,409 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2022-07-23 06:05:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,409 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-23 06:05:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-23 06:05:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:05:42,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:05:42,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -489508983, now seen corresponding path program 1 times [2022-07-23 06:05:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345990000] [2022-07-23 06:05:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345990000] [2022-07-23 06:05:42,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345990000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:42,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:42,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:05:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957499058] [2022-07-23 06:05:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:42,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:05:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:05:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:05:42,459 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,483 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-07-23 06:05:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:05:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:05:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,484 INFO L225 Difference]: With dead ends: 43 [2022-07-23 06:05:42,484 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 06:05:42,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:05:42,485 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 06:05:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 06:05:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 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-07-23 06:05:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-23 06:05:42,489 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2022-07-23 06:05:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,490 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-23 06:05:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-23 06:05:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:05:42,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:05:42,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash -489508982, now seen corresponding path program 1 times [2022-07-23 06:05:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065888912] [2022-07-23 06:05:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065888912] [2022-07-23 06:05:42,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065888912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:42,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:42,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:05:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796328962] [2022-07-23 06:05:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:42,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:05:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:05:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:42,617 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,662 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-07-23 06:05:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:05:42,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:05:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,663 INFO L225 Difference]: With dead ends: 50 [2022-07-23 06:05:42,663 INFO L226 Difference]: Without dead ends: 50 [2022-07-23 06:05:42,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:05:42,664 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-23 06:05:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-23 06:05:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-23 06:05:42,668 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2022-07-23 06:05:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,668 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-23 06:05:42,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-23 06:05:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:05:42,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:05:42,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839934, now seen corresponding path program 1 times [2022-07-23 06:05:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255389994] [2022-07-23 06:05:42,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255389994] [2022-07-23 06:05:42,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255389994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:42,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:42,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:05:42,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746313752] [2022-07-23 06:05:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:42,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:05:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:05:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:05:42,707 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-07-23 06:05:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:42,734 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-23 06:05:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:05:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-23 06:05:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:42,735 INFO L225 Difference]: With dead ends: 47 [2022-07-23 06:05:42,735 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 06:05:42,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:42,736 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:42,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 06:05:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-23 06:05:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 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-07-23 06:05:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-23 06:05:42,740 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2022-07-23 06:05:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:42,740 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-23 06:05:42,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-07-23 06:05:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-23 06:05:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:05:42,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:42,741 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:42,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:05:42,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839933, now seen corresponding path program 1 times [2022-07-23 06:05:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850020213] [2022-07-23 06:05:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850020213] [2022-07-23 06:05:42,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850020213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948177267] [2022-07-23 06:05:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:42,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:42,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:05:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:42,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:05:42,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:42,943 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-07-23 06:05:42,974 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:05:42,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:05:43,049 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-07-23 06:05:43,095 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:05:43,095 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-07-23 06:05:43,137 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:05:43,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:05:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:43,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:49,466 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 10 treesize of output 8 [2022-07-23 06:05:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:51,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948177267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:51,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:51,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-07-23 06:05:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204605424] [2022-07-23 06:05:51,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:51,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 06:05:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 06:05:51,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=157, Unknown=3, NotChecked=0, Total=210 [2022-07-23 06:05:51,757 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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-07-23 06:05:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:52,239 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2022-07-23 06:05:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:05:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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 16 [2022-07-23 06:05:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:52,245 INFO L225 Difference]: With dead ends: 188 [2022-07-23 06:05:52,245 INFO L226 Difference]: Without dead ends: 188 [2022-07-23 06:05:52,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=210, Invalid=599, Unknown=3, NotChecked=0, Total=812 [2022-07-23 06:05:52,248 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 385 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 146 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 279 Unchecked, 0.2s Time] [2022-07-23 06:05:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-23 06:05:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 113. [2022-07-23 06:05:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 112 states have internal predecessors, (150), 0 states have call successors, (0), 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-07-23 06:05:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2022-07-23 06:05:52,284 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 16 [2022-07-23 06:05:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:52,285 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2022-07-23 06:05:52,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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-07-23 06:05:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2022-07-23 06:05:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:05:52,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:52,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:52,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:52,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:52,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash -411430410, now seen corresponding path program 1 times [2022-07-23 06:05:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:52,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681763858] [2022-07-23 06:05:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:52,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681763858] [2022-07-23 06:05:52,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681763858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:52,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:52,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:05:52,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376415376] [2022-07-23 06:05:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:52,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:05:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:52,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:05:52,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:05:52,537 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-07-23 06:05:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:52,550 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2022-07-23 06:05:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:05:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-07-23 06:05:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:52,551 INFO L225 Difference]: With dead ends: 112 [2022-07-23 06:05:52,551 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 06:05:52,551 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-07-23 06:05:52,552 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:52,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 06:05:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-23 06:05:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.4) internal successors, (147), 111 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-07-23 06:05:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2022-07-23 06:05:52,556 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 17 [2022-07-23 06:05:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:52,556 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2022-07-23 06:05:52,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-07-23 06:05:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2022-07-23 06:05:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:05:52,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:52,557 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:52,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:05:52,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -411430409, now seen corresponding path program 1 times [2022-07-23 06:05:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686069731] [2022-07-23 06:05:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:52,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686069731] [2022-07-23 06:05:52,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686069731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:52,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913125666] [2022-07-23 06:05:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:52,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:52,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:52,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:05:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:52,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:05:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:52,688 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-07-23 06:05:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:52,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:52,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913125666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:52,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:52,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-23 06:05:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987590779] [2022-07-23 06:05:52,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:52,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:05:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:05:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:05:52,734 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:52,805 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2022-07-23 06:05:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:05:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 06:05:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:52,807 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:05:52,807 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:05:52,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:05:52,809 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:52,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 87 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:05:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2022-07-23 06:05:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.4) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 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-07-23 06:05:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2022-07-23 06:05:52,822 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 17 [2022-07-23 06:05:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:52,823 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2022-07-23 06:05:52,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2022-07-23 06:05:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:05:52,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:52,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:52,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-23 06:05:53,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 130511665, now seen corresponding path program 1 times [2022-07-23 06:05:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243351504] [2022-07-23 06:05:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243351504] [2022-07-23 06:05:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243351504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:05:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756828519] [2022-07-23 06:05:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:53,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:05:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:05:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:05:53,087 INFO L87 Difference]: Start difference. First operand 117 states and 154 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-07-23 06:05:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:53,106 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2022-07-23 06:05:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:05:53,106 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-07-23 06:05:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:53,107 INFO L225 Difference]: With dead ends: 116 [2022-07-23 06:05:53,107 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 06:05:53,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:05:53,107 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 06:05:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-23 06:05:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 115 states have internal predecessors, (150), 0 states have call successors, (0), 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-07-23 06:05:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-07-23 06:05:53,110 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 18 [2022-07-23 06:05:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:53,110 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-07-23 06:05:53,110 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-07-23 06:05:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-07-23 06:05:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:05:53,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:53,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:53,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:05:53,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash 130511666, now seen corresponding path program 1 times [2022-07-23 06:05:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:53,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451892697] [2022-07-23 06:05:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451892697] [2022-07-23 06:05:53,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451892697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531414320] [2022-07-23 06:05:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:53,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:53,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:53,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:05:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:05:53,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531414320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:53,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:53,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-23 06:05:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997910840] [2022-07-23 06:05:53,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:05:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:05:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:05:53,286 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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-07-23 06:05:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:53,346 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-07-23 06:05:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:05:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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-07-23 06:05:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:53,347 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:05:53,348 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:05:53,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:05:53,348 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:53,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 98 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:05:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2022-07-23 06:05:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 103 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-23 06:05:53,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 18 [2022-07-23 06:05:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:53,351 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-23 06:05:53,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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-07-23 06:05:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-23 06:05:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:05:53,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:53,352 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-07-23 06:05:53,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:53,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash 624099572, now seen corresponding path program 1 times [2022-07-23 06:05:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:53,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086616358] [2022-07-23 06:05:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086616358] [2022-07-23 06:05:53,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086616358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960711077] [2022-07-23 06:05:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:53,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:53,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:05:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:05:53,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960711077] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:53,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:53,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 06:05:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498364929] [2022-07-23 06:05:53,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:53,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:05:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:05:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:05:53,694 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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-07-23 06:05:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:53,722 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2022-07-23 06:05:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:05:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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-07-23 06:05:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:53,723 INFO L225 Difference]: With dead ends: 168 [2022-07-23 06:05:53,723 INFO L226 Difference]: Without dead ends: 168 [2022-07-23 06:05:53,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:05:53,724 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:53,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 112 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-23 06:05:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-07-23 06:05:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 159 states have internal predecessors, (201), 0 states have call successors, (0), 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-07-23 06:05:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2022-07-23 06:05:53,727 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 20 [2022-07-23 06:05:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:53,727 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2022-07-23 06:05:53,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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-07-23 06:05:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-07-23 06:05:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:05:53,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:53,728 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-07-23 06:05:53,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:53,946 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1752050598, now seen corresponding path program 1 times [2022-07-23 06:05:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037498498] [2022-07-23 06:05:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:53,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037498498] [2022-07-23 06:05:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037498498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821114893] [2022-07-23 06:05:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:53,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:53,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:05:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:54,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:05:54,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:54,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:54,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821114893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:54,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:54,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-23 06:05:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340006948] [2022-07-23 06:05:54,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:54,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:05:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:05:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:05:54,128 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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-07-23 06:05:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:54,232 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-07-23 06:05:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:05:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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-07-23 06:05:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:54,233 INFO L225 Difference]: With dead ends: 160 [2022-07-23 06:05:54,233 INFO L226 Difference]: Without dead ends: 160 [2022-07-23 06:05:54,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:05:54,234 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 96 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:54,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 133 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-23 06:05:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-23 06:05:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 157 states have internal predecessors, (196), 0 states have call successors, (0), 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-07-23 06:05:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2022-07-23 06:05:54,237 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 21 [2022-07-23 06:05:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:54,237 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2022-07-23 06:05:54,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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-07-23 06:05:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-07-23 06:05:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:05:54,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:54,238 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] [2022-07-23 06:05:54,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-23 06:05:54,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -93493367, now seen corresponding path program 1 times [2022-07-23 06:05:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905830293] [2022-07-23 06:05:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905830293] [2022-07-23 06:05:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905830293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533905144] [2022-07-23 06:05:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:54,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:54,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:54,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:05:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:54,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:05:54,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:54,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:54,703 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 28 treesize of output 24 [2022-07-23 06:05:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:54,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533905144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:54,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:54,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-23 06:05:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772285300] [2022-07-23 06:05:54,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:54,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:05:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:05:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:05:54,718 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:54,844 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2022-07-23 06:05:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:05:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 06:05:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:54,845 INFO L225 Difference]: With dead ends: 220 [2022-07-23 06:05:54,845 INFO L226 Difference]: Without dead ends: 220 [2022-07-23 06:05:54,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:05:54,846 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 94 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:54,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 118 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-23 06:05:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 163. [2022-07-23 06:05:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 162 states have internal predecessors, (201), 0 states have call successors, (0), 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-07-23 06:05:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2022-07-23 06:05:54,848 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 23 [2022-07-23 06:05:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:54,849 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2022-07-23 06:05:54,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2022-07-23 06:05:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:05:54,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:54,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:54,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:55,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:55,060 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1409452358, now seen corresponding path program 1 times [2022-07-23 06:05:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:55,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394559282] [2022-07-23 06:05:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:55,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394559282] [2022-07-23 06:05:55,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394559282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:55,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195569877] [2022-07-23 06:05:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:55,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:55,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:55,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:55,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:05:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:55,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:05:55,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195569877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:55,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:55,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-23 06:05:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000670697] [2022-07-23 06:05:55,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:55,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:05:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:05:55,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:05:55,235 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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-07-23 06:05:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:55,308 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2022-07-23 06:05:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:05:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:05:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:55,309 INFO L225 Difference]: With dead ends: 158 [2022-07-23 06:05:55,309 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 06:05:55,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:05:55,310 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 71 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:55,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 105 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:05:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 06:05:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2022-07-23 06:05:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 147 states have internal predecessors, (181), 0 states have call successors, (0), 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-07-23 06:05:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-07-23 06:05:55,312 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 27 [2022-07-23 06:05:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:55,312 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-07-23 06:05:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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-07-23 06:05:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-07-23 06:05:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:05:55,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:55,313 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] [2022-07-23 06:05:55,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:55,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:55,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1360755252, now seen corresponding path program 1 times [2022-07-23 06:05:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:55,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920823526] [2022-07-23 06:05:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:55,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920823526] [2022-07-23 06:05:55,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920823526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:55,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219641189] [2022-07-23 06:05:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:55,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:55,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:55,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:55,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 06:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:55,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:05:55,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:05:55,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219641189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:05:55,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:05:55,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-23 06:05:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834939099] [2022-07-23 06:05:55,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:05:55,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:05:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:05:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:05:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:05:55,747 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-07-23 06:05:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:55,879 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-07-23 06:05:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:05:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:05:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:55,880 INFO L225 Difference]: With dead ends: 150 [2022-07-23 06:05:55,880 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 06:05:55,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:05:55,881 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 181 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:55,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 155 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:05:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 06:05:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-23 06:05:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 146 states have internal predecessors, (178), 0 states have call successors, (0), 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-07-23 06:05:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-07-23 06:05:55,883 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 27 [2022-07-23 06:05:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-07-23 06:05:55,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-07-23 06:05:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-07-23 06:05:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:05:55,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:55,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:55,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:56,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 06:05:56,095 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:05:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash -144329733, now seen corresponding path program 1 times [2022-07-23 06:05:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:05:56,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418026783] [2022-07-23 06:05:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:05:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:05:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:05:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418026783] [2022-07-23 06:05:56,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418026783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:05:56,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966876945] [2022-07-23 06:05:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:05:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:05:56,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:05:56,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 06:05:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:56,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:05:56,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:56,373 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-07-23 06:05:56,451 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:05:56,452 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 23 treesize of output 18 [2022-07-23 06:05:56,509 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-07-23 06:05:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:56,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:05,113 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 14 treesize of output 12 [2022-07-23 06:06:05,115 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 26 treesize of output 24 [2022-07-23 06:06:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:06:05,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966876945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:05,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:05,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 31 [2022-07-23 06:06:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390860357] [2022-07-23 06:06:05,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 06:06:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 06:06:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=833, Unknown=3, NotChecked=0, Total=930 [2022-07-23 06:06:05,204 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-23 06:06:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:05,780 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2022-07-23 06:06:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:06:05,780 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-23 06:06:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:05,781 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:06:05,781 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:06:05,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=344, Invalid=2203, Unknown=3, NotChecked=0, Total=2550 [2022-07-23 06:06:05,782 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 91 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 265 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 393 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-23 06:06:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:06:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-23 06:06:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 123 states have internal predecessors, (146), 0 states have call successors, (0), 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-07-23 06:06:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-23 06:06:05,784 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 31 [2022-07-23 06:06:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:05,784 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-23 06:06:05,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-23 06:06:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-23 06:06:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:06:05,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:05,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:06:05,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:06:05,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2032716941, now seen corresponding path program 1 times [2022-07-23 06:06:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348056367] [2022-07-23 06:06:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:06:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348056367] [2022-07-23 06:06:06,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348056367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136574180] [2022-07-23 06:06:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:06,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:06,110 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:06,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:06:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:06,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:06:06,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:06,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:06:06,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 06:06:06,326 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:06:06,326 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-07-23 06:06:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:06,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:08,529 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 53 treesize of output 49 [2022-07-23 06:06:08,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:06:08,544 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 55 treesize of output 73 [2022-07-23 06:06:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:08,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136574180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:08,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:08,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-07-23 06:06:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909196634] [2022-07-23 06:06:08,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:08,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 06:06:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 06:06:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:06:08,682 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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-07-23 06:06:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:09,005 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2022-07-23 06:06:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:06:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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) Word has length 41 [2022-07-23 06:06:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:09,007 INFO L225 Difference]: With dead ends: 208 [2022-07-23 06:06:09,007 INFO L226 Difference]: Without dead ends: 208 [2022-07-23 06:06:09,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:06:09,008 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 254 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:09,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 186 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 218 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-07-23 06:06:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-23 06:06:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2022-07-23 06:06:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1914893617021276) internal successors, (112), 98 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-07-23 06:06:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-07-23 06:06:09,010 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 41 [2022-07-23 06:06:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:09,010 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-07-23 06:06:09,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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-07-23 06:06:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-07-23 06:06:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:06:09,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:09,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:06:09,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:09,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:06:09,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1410284307, now seen corresponding path program 1 times [2022-07-23 06:06:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630305127] [2022-07-23 06:06:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:09,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630305127] [2022-07-23 06:06:09,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630305127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:09,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751898110] [2022-07-23 06:06:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:09,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:09,295 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:09,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 06:06:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:09,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:06:09,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:09,396 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-07-23 06:06:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:09,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:09,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751898110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:09,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:09,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-23 06:06:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759171027] [2022-07-23 06:06:09,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:09,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:06:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:06:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:06:09,524 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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-07-23 06:06:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:09,658 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2022-07-23 06:06:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:06:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:06:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:09,659 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:06:09,659 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:06:09,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:06:09,660 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:09,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 177 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:06:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:06:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2022-07-23 06:06:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.1875) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 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-07-23 06:06:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-07-23 06:06:09,662 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 42 [2022-07-23 06:06:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:09,662 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-07-23 06:06:09,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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-07-23 06:06:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-07-23 06:06:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:06:09,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:09,663 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:06:09,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:09,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:09,875 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 183114832, now seen corresponding path program 2 times [2022-07-23 06:06:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:09,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784523508] [2022-07-23 06:06:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:09,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784523508] [2022-07-23 06:06:09,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784523508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:09,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65259008] [2022-07-23 06:06:09,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:06:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:09,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:09,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 06:06:09,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:06:09,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:06:09,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:06:09,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:10,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:06:10,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65259008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:10,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-23 06:06:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879133922] [2022-07-23 06:06:10,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:10,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:06:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:06:10,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:06:10,142 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-07-23 06:06:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:10,335 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-07-23 06:06:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:06:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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 46 [2022-07-23 06:06:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:10,336 INFO L225 Difference]: With dead ends: 118 [2022-07-23 06:06:10,336 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 06:06:10,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-07-23 06:06:10,337 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 273 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:10,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 169 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:06:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 06:06:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2022-07-23 06:06:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 98 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-07-23 06:06:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-23 06:06:10,339 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2022-07-23 06:06:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:10,339 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-23 06:06:10,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-07-23 06:06:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-23 06:06:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 06:06:10,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:10,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-23 06:06:10,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:10,540 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 457132991, now seen corresponding path program 2 times [2022-07-23 06:06:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:10,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172032359] [2022-07-23 06:06:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:06:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:10,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172032359] [2022-07-23 06:06:10,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172032359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:10,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858350952] [2022-07-23 06:06:10,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:06:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:10,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:10,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-23 06:06:10,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:06:10,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:06:10,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:06:10,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:06:10,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:06:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858350952] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:10,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-23 06:06:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659899451] [2022-07-23 06:06:10,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:06:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:06:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:06:10,806 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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-07-23 06:06:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:10,894 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-07-23 06:06:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:06:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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 47 [2022-07-23 06:06:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:10,895 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:06:10,895 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:06:10,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:06:10,896 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:10,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 139 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:06:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:06:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-07-23 06:06:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 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-07-23 06:06:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-23 06:06:10,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2022-07-23 06:06:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:10,898 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-23 06:06:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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-07-23 06:06:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-23 06:06:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:06:10,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:10,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-23 06:06:10,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:11,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-23 06:06:11,107 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -269976254, now seen corresponding path program 3 times [2022-07-23 06:06:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:11,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180318783] [2022-07-23 06:06:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:06:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180318783] [2022-07-23 06:06:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180318783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065652841] [2022-07-23 06:06:11,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:06:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:11,242 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:11,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 06:06:11,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-23 06:06:11,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:06:11,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:06:11,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:11,310 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-07-23 06:06:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 06:06:11,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 06:06:11,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065652841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:11,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:11,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2022-07-23 06:06:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557973700] [2022-07-23 06:06:11,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 06:06:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 06:06:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:06:11,625 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:06:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:12,181 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-23 06:06:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:06:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-23 06:06:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:12,182 INFO L225 Difference]: With dead ends: 128 [2022-07-23 06:06:12,182 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 06:06:12,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 06:06:12,183 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 214 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:12,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 167 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:06:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 06:06:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2022-07-23 06:06:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 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-07-23 06:06:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-23 06:06:12,185 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 52 [2022-07-23 06:06:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:12,185 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-23 06:06:12,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:06:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-23 06:06:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:06:12,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:12,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-23 06:06:12,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:12,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:12,395 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1642790799, now seen corresponding path program 2 times [2022-07-23 06:06:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424991638] [2022-07-23 06:06:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:06:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:12,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424991638] [2022-07-23 06:06:12,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424991638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:12,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880424768] [2022-07-23 06:06:12,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:06:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:12,473 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:12,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 06:06:12,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:06:12,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:06:12,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:06:12,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:06:12,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:06:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880424768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:12,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:12,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-23 06:06:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135117253] [2022-07-23 06:06:12,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:06:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:06:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:06:12,704 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-23 06:06:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:06:12,860 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-23 06:06:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:06:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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 56 [2022-07-23 06:06:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:06:12,861 INFO L225 Difference]: With dead ends: 110 [2022-07-23 06:06:12,861 INFO L226 Difference]: Without dead ends: 110 [2022-07-23 06:06:12,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:06:12,862 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 91 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:06:12,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 284 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:06:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-23 06:06:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-07-23 06:06:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.11) internal successors, (111), 103 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-07-23 06:06:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-07-23 06:06:12,864 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 56 [2022-07-23 06:06:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:06:12,864 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-07-23 06:06:12,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-23 06:06:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-07-23 06:06:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 06:06:12,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:06:12,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-23 06:06:12,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 06:06:13,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:13,076 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:06:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:06:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 74449076, now seen corresponding path program 3 times [2022-07-23 06:06:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:06:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543523787] [2022-07-23 06:06:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:06:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:06:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:06:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:06:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:06:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543523787] [2022-07-23 06:06:13,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543523787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:06:13,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870964892] [2022-07-23 06:06:13,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:06:13,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:06:13,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:06:13,336 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:06:13,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-23 06:06:13,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 06:06:13,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:06:13,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-23 06:06:13,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:06:13,430 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-07-23 06:06:13,434 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-07-23 06:06:13,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:06:13,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:06:13,466 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:06:13,467 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-07-23 06:06:13,547 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:06:13,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:06:13,644 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-07-23 06:06:13,757 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:06:13,757 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 16 treesize of output 18 [2022-07-23 06:06:13,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:06:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 06:06:13,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:06:20,192 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:06:30,308 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:06:40,437 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:06:40,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:06:40,487 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 75 treesize of output 93 [2022-07-23 06:06:56,876 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:06:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 06:06:57,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870964892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:06:57,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:06:57,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2022-07-23 06:06:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84317182] [2022-07-23 06:06:57,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:06:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:06:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:06:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:06:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=794, Unknown=4, NotChecked=0, Total=992 [2022-07-23 06:06:57,130 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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-07-23 06:07:35,788 WARN L233 SmtUtils]: Spent 24.05s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:07:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:07:39,967 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-07-23 06:07:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:07:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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 60 [2022-07-23 06:07:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:07:39,969 INFO L225 Difference]: With dead ends: 171 [2022-07-23 06:07:39,969 INFO L226 Difference]: Without dead ends: 171 [2022-07-23 06:07:39,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 105 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=495, Invalid=1846, Unknown=11, NotChecked=0, Total=2352 [2022-07-23 06:07:39,970 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 287 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:07:39,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 336 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 212 Invalid, 0 Unknown, 289 Unchecked, 0.1s Time] [2022-07-23 06:07:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-23 06:07:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2022-07-23 06:07:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1383647798742138) internal successors, (181), 162 states have internal predecessors, (181), 0 states have call successors, (0), 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-07-23 06:07:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2022-07-23 06:07:39,975 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 60 [2022-07-23 06:07:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:07:39,976 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2022-07-23 06:07:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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-07-23 06:07:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-07-23 06:07:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-23 06:07:39,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:07:39,977 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-23 06:07:40,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-23 06:07:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 06:07:40,178 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:07:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:07:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -809246151, now seen corresponding path program 1 times [2022-07-23 06:07:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:07:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377592456] [2022-07-23 06:07:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:07:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 92 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 06:07:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:07:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377592456] [2022-07-23 06:07:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377592456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:07:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048402320] [2022-07-23 06:07:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:40,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:07:40,345 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:07:40,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-23 06:07:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:40,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:07:40,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:07:40,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:40,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 06:07:40,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:07:40,649 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-07-23 06:07:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:40,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:07:40,909 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 53 treesize of output 49 [2022-07-23 06:07:40,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:07:40,920 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 55 treesize of output 73 [2022-07-23 06:07:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:41,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048402320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:07:41,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:07:41,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-07-23 06:07:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667463540] [2022-07-23 06:07:41,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:07:41,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:07:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:07:41,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:07:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:07:41,129 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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-07-23 06:07:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:07:41,622 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2022-07-23 06:07:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:07:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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 75 [2022-07-23 06:07:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:07:41,623 INFO L225 Difference]: With dead ends: 244 [2022-07-23 06:07:41,623 INFO L226 Difference]: Without dead ends: 244 [2022-07-23 06:07:41,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2022-07-23 06:07:41,624 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 176 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:07:41,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 541 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 552 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-07-23 06:07:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-23 06:07:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 175. [2022-07-23 06:07:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 171 states have (on average 1.1461988304093567) internal successors, (196), 174 states have internal predecessors, (196), 0 states have call successors, (0), 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-07-23 06:07:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-07-23 06:07:41,628 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 75 [2022-07-23 06:07:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:07:41,628 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-07-23 06:07:41,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 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-07-23 06:07:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-07-23 06:07:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 06:07:41,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:07:41,629 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-23 06:07:41,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-23 06:07:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:41,839 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:07:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:07:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 683173057, now seen corresponding path program 1 times [2022-07-23 06:07:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:07:41,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958636274] [2022-07-23 06:07:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:07:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 88 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:07:41,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958636274] [2022-07-23 06:07:41,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958636274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:07:41,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077911405] [2022-07-23 06:07:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:07:41,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:07:41,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-23 06:07:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:42,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:07:42,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:07:42,127 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-07-23 06:07:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:42,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:07:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:42,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077911405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:07:42,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:07:42,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-23 06:07:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337876418] [2022-07-23 06:07:42,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:07:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 06:07:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:07:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 06:07:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:07:42,250 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:07:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:07:42,454 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-07-23 06:07:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:07:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-23 06:07:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:07:42,456 INFO L225 Difference]: With dead ends: 223 [2022-07-23 06:07:42,456 INFO L226 Difference]: Without dead ends: 223 [2022-07-23 06:07:42,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:07:42,456 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 88 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:07:42,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 371 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:07:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-23 06:07:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2022-07-23 06:07:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 177 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-07-23 06:07:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-07-23 06:07:42,459 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 76 [2022-07-23 06:07:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:07:42,459 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-07-23 06:07:42,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:07:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-07-23 06:07:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-23 06:07:42,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:07:42,459 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-23 06:07:42,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-23 06:07:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:42,660 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:07:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:07:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1737117148, now seen corresponding path program 2 times [2022-07-23 06:07:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:07:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65028990] [2022-07-23 06:07:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:07:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 137 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:07:42,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65028990] [2022-07-23 06:07:42,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65028990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:07:42,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351497478] [2022-07-23 06:07:42,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:07:42,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:42,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:07:42,784 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:07:42,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-23 06:07:42,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:07:42,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:07:42,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:07:42,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:07:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:43,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:07:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:07:43,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351497478] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:07:43,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:07:43,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-07-23 06:07:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161779100] [2022-07-23 06:07:43,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:07:43,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:07:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:07:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:07:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:07:43,122 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 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-07-23 06:07:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:07:43,370 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2022-07-23 06:07:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:07:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-23 06:07:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:07:43,371 INFO L225 Difference]: With dead ends: 220 [2022-07-23 06:07:43,371 INFO L226 Difference]: Without dead ends: 220 [2022-07-23 06:07:43,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 06:07:43,372 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 263 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:07:43,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 291 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:07:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-23 06:07:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2022-07-23 06:07:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.127906976744186) internal successors, (194), 175 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-07-23 06:07:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2022-07-23 06:07:43,378 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 80 [2022-07-23 06:07:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:07:43,378 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2022-07-23 06:07:43,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 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-07-23 06:07:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2022-07-23 06:07:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 06:07:43,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:07:43,379 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-23 06:07:43,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-23 06:07:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:43,597 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:07:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:07:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2063647327, now seen corresponding path program 4 times [2022-07-23 06:07:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:07:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987044495] [2022-07-23 06:07:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:07:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:07:43,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:07:43,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987044495] [2022-07-23 06:07:43,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987044495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:07:43,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031175196] [2022-07-23 06:07:43,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 06:07:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:43,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:07:43,740 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:07:43,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-23 06:07:43,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 06:07:43,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:07:43,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:07:43,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:07:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 06:07:44,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:07:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 06:07:44,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031175196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:07:44,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:07:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2022-07-23 06:07:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249464592] [2022-07-23 06:07:44,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:07:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 06:07:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:07:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 06:07:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:07:44,125 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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-07-23 06:07:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:07:44,406 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2022-07-23 06:07:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:07:44,406 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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 89 [2022-07-23 06:07:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:07:44,407 INFO L225 Difference]: With dead ends: 197 [2022-07-23 06:07:44,407 INFO L226 Difference]: Without dead ends: 197 [2022-07-23 06:07:44,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:07:44,407 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:07:44,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 310 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:07:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-23 06:07:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-23 06:07:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 187 states have internal predecessors, (203), 0 states have call successors, (0), 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-07-23 06:07:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2022-07-23 06:07:44,410 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 89 [2022-07-23 06:07:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:07:44,410 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2022-07-23 06:07:44,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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-07-23 06:07:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-07-23 06:07:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-23 06:07:44,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:07:44,411 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-23 06:07:44,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-23 06:07:44,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-23 06:07:44,619 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:07:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:07:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1513850931, now seen corresponding path program 5 times [2022-07-23 06:07:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:07:44,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379007798] [2022-07-23 06:07:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:07:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:07:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:07:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 06:07:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:07:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379007798] [2022-07-23 06:07:45,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379007798] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:07:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374652419] [2022-07-23 06:07:45,031 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 06:07:45,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:07:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:07:45,032 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:07:45,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-23 06:07:45,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-23 06:07:45,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:07:45,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-23 06:07:45,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:07:45,302 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 15 treesize of output 11 [2022-07-23 06:07:45,360 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:07:45,360 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-07-23 06:07:45,408 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 19 treesize of output 21 [2022-07-23 06:07:45,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:45,609 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 28 treesize of output 27 [2022-07-23 06:07:45,689 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:07:45,689 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-07-23 06:07:45,754 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 31 treesize of output 31 [2022-07-23 06:07:45,834 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 31 treesize of output 31 [2022-07-23 06:07:46,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,075 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 30 treesize of output 32 [2022-07-23 06:07:46,132 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:07:46,132 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-07-23 06:07:46,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:07:46,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-23 06:07:46,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:07:46,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2022-07-23 06:07:46,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:07:46,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-07-23 06:07:47,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 25 [2022-07-23 06:07:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 229 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:07:47,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:07:49,447 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:07:49,447 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-07-23 06:07:51,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) is different from false [2022-07-23 06:07:52,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) is different from false [2022-07-23 06:07:55,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) is different from false [2022-07-23 06:07:55,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-23 06:07:55,699 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:07:55,699 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-07-23 06:07:55,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_833)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-23 06:07:55,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_833 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-23 06:07:55,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-23 06:07:59,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:07:59,538 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 1 case distinctions, treesize of input 635 treesize of output 383 [2022-07-23 06:07:59,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:07:59,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:07:59,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:07:59,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 337 [2022-07-23 06:07:59,566 INFO L356 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2022-07-23 06:07:59,566 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 2313 treesize of output 2199 [2022-07-23 06:07:59,591 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:07:59,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 06:08:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 9 proven. 74 refuted. 3 times theorem prover too weak. 10 trivial. 147 not checked. [2022-07-23 06:08:00,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374652419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:08:00,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:08:00,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 41, 41] total 95 [2022-07-23 06:08:00,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584700429] [2022-07-23 06:08:00,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:08:00,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-23 06:08:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:08:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-23 06:08:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=7233, Unknown=24, NotChecked=1246, Total=8930 [2022-07-23 06:08:00,928 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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-07-23 06:08:02,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse8 (+ 392 .cse5)) (.cse9 (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 8) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= .cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (= 400 .cse9) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (<= .cse8 .cse9)))) is different from false [2022-07-23 06:08:02,571 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-23 06:08:02,578 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-23 06:08:02,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:02,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:02,604 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse12 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse12) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (not .cse12) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:02,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:04,632 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_#res#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:06,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_main_#t~ret6#1|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse3) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse3 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~i~2#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-23 06:08:06,823 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388)) (.cse8 (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (<= 2 (select .cse0 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse6 .cse7) (<= .cse6 .cse8) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse9 0) 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (not (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse14 (store (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse15) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse13 (store (select .cse14 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse15 4) v_ArrVal_836))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~#b~0#1.base| .cse13)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse12))) (or (< v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse11) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse11 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse12)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (<= 1 (select .cse0 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 1) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) .cse8) .cse7) 0) (<= 2 (select .cse9 8)) (<= 1 (select .cse9 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-23 06:08:06,834 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1))) (< 0 (+ 3 |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~i~1#1|)) (< 0 |c_ULTIMATE.start_main_~i~2#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))))) is different from false [2022-07-23 06:08:06,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse6 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-23 06:08:06,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (= |c_ULTIMATE.start_foo_#t~mem3#1| (select .cse0 (+ |c_ULTIMATE.start_foo_~b#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse0 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse0 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-23 06:08:06,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8))) (.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= .cse6 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse7 8)) (<= 1 (select .cse7 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse18 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse18) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse18 4) v_ArrVal_836))) (let ((.cse13 (store .cse17 |c_ULTIMATE.start_main_~#b~0#1.base| .cse16)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse15))) (or (< v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse14) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse14 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse15)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-23 06:08:06,901 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8 (- 4)))) (.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= .cse6 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (or (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse18 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse18) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse18 4) v_ArrVal_836))) (let ((.cse13 (store .cse17 |c_ULTIMATE.start_main_~#b~0#1.base| .cse16)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse15))) (or (< v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse14) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse14 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse15)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse7 8)) (<= 1 (select .cse7 4)) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8 (- 4)))) (.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= .cse6 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8 (- 4)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse7 8)) (<= 1 (select .cse7 4)) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4)))) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6)) |c_ULTIMATE.start_foo_#t~mem3#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= .cse8 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse8 (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse5 8)) (<= 1 (select .cse5 4)) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,933 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse9 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse7 (select .cse14 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse9 (- 4)))) (.cse0 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse9))) (.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (<= 1 .cse0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= .cse7 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse7 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse9 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse13)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse12))) (or (< v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse11) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse11 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse12)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (<= .cse0 (select .cse14 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse9))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse8 8)) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse9 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= .cse7 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse8) (= (select .cse9 |c_ULTIMATE.start_foo_~b#1.offset|) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse13)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse12))) (or (< v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse11) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse11 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse12)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse8) 0) (<= 2 (select .cse9 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,953 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse9 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= .cse7 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse8) (= (select .cse9 |c_ULTIMATE.start_foo_~b#1.offset|) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse8) 0) (<= 2 (select .cse9 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-23 06:08:06,961 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse6 (select .cse8 4))) (and (<= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse8 0) (select .cse7 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (<= (select .cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) |c_ULTIMATE.start_foo_#t~mem3#1|) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse6) (<= 2 (select .cse8 8)))))) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-23 06:08:06,972 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse12 (select .cse13 4)) (.cse10 (select .cse13 8))) (and (<= .cse10 (select .cse11 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse12 (select .cse11 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse13 0) (select .cse11 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse12) (<= 2 .cse10))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-23 06:08:08,980 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse6 (select .cse7 4)) (.cse4 (select .cse7 8))) (and (<= .cse4 (select .cse5 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse6 (select .cse5 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse7 0) (select .cse5 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse6) (<= 2 .cse4))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-23 06:08:10,620 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse7 (select .cse6 4)) (.cse4 (select .cse6 8))) (and (<= .cse4 (select .cse5 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse6 0) (select .cse5 0)) (<= .cse7 (select .cse5 4)) (<= 1 .cse7) (<= 2 .cse4))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0)) is different from false [2022-07-23 06:08:12,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse4 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse8 (select .cse7 4)) (.cse5 (select .cse7 8))) (and (<= .cse5 (select .cse6 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse7 0) (select .cse6 0)) (<= .cse8 (select .cse6 4)) (<= 1 .cse8) (<= 2 .cse5))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0))) is different from false [2022-07-23 06:08:14,631 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse7 (select .cse6 4)) (.cse4 (select .cse6 8))) (and (<= .cse4 (select .cse5 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse6 0) (select .cse5 0)) (<= .cse7 (select .cse5 4)) (<= 1 .cse7) (<= 2 .cse4))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)) is different from false [2022-07-23 06:08:16,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse4 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse8 (select .cse7 4)) (.cse5 (select .cse7 8))) (and (<= .cse5 (select .cse6 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse7 0) (select .cse6 0)) (<= .cse8 (select .cse6 4)) (<= 1 .cse8) (<= 2 .cse5))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-23 06:08:18,642 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (<= (select .cse0 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse8 (select .cse7 4)) (.cse5 (select .cse7 8))) (and (<= .cse5 (select .cse6 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse7 0) (select .cse6 0)) (<= .cse8 (select .cse6 4)) (<= 1 .cse8) (<= 2 .cse5))))) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-23 06:08:20,648 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= 1 (+ (- 1) |c_ULTIMATE.start_bar_~i~0#1|)) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse8 (select .cse7 4)) (.cse5 (select .cse7 8))) (and (<= .cse5 (select .cse6 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse7 0) (select .cse6 0)) (<= .cse8 (select .cse6 4)) (<= 1 .cse8) (<= 2 .cse5))))) (<= (select .cse4 (+ (- 4) (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-23 06:08:22,414 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_bar_~res~0#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_bar_#t~mem1#1|) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-23 06:08:24,001 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_bar_~res~0#1|)) is different from false [2022-07-23 06:08:26,007 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-23 06:08:28,012 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= 3 |c_ULTIMATE.start_bar_#res#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-23 06:08:30,017 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_foo_#t~ret4#1|)) is different from false [2022-07-23 06:08:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:08:37,243 INFO L93 Difference]: Finished difference Result 373 states and 403 transitions. [2022-07-23 06:08:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-23 06:08:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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 98 [2022-07-23 06:08:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:08:37,245 INFO L225 Difference]: With dead ends: 373 [2022-07-23 06:08:37,245 INFO L226 Difference]: Without dead ends: 373 [2022-07-23 06:08:37,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 168 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 3359 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=1086, Invalid=15267, Unknown=71, NotChecked=12306, Total=28730 [2022-07-23 06:08:37,251 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 181 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 4461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2362 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:08:37,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1885 Invalid, 4461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2044 Invalid, 0 Unknown, 2362 Unchecked, 1.0s Time] [2022-07-23 06:08:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-23 06:08:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 273. [2022-07-23 06:08:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.0929368029739777) internal successors, (294), 272 states have internal predecessors, (294), 0 states have call successors, (0), 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-07-23 06:08:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 294 transitions. [2022-07-23 06:08:37,255 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 294 transitions. Word has length 98 [2022-07-23 06:08:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:08:37,255 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 294 transitions. [2022-07-23 06:08:37,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 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-07-23 06:08:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 294 transitions. [2022-07-23 06:08:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-23 06:08:37,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:08:37,256 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1] [2022-07-23 06:08:37,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-23 06:08:37,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-23 06:08:37,478 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:08:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:08:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1090204209, now seen corresponding path program 1 times [2022-07-23 06:08:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:08:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451828787] [2022-07-23 06:08:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:08:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:08:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:08:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 06:08:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:08:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451828787] [2022-07-23 06:08:37,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451828787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:08:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082412281] [2022-07-23 06:08:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:08:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:08:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:08:37,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:08:37,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-23 06:08:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:08:38,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:08:38,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:08:38,076 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-07-23 06:08:38,081 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-07-23 06:08:38,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:08:38,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:08:38,109 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:08:38,109 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-07-23 06:08:38,176 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:08:38,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:08:38,196 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:08:38,197 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-07-23 06:08:38,325 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:08:38,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:08:38,335 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:08:38,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-07-23 06:08:38,523 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:08:38,523 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-07-23 06:08:38,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:08:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:08:38,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:08:47,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:08:47,037 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 43 treesize of output 61 [2022-07-23 06:08:51,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:08:51,603 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 43 treesize of output 61 [2022-07-23 06:08:53,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:08:53,973 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 43 treesize of output 61 [2022-07-23 06:08:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:08:58,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082412281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:08:58,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:08:58,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 35 [2022-07-23 06:08:58,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600495440] [2022-07-23 06:08:58,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:08:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:08:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:08:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:08:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1046, Unknown=1, NotChecked=0, Total=1260 [2022-07-23 06:08:58,971 INFO L87 Difference]: Start difference. First operand 273 states and 294 transitions. Second operand has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 0 states have call successors, (0), 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-07-23 06:08:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:08:59,917 INFO L93 Difference]: Finished difference Result 379 states and 416 transitions. [2022-07-23 06:08:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:08:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 0 states have call successors, (0), 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 98 [2022-07-23 06:08:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:08:59,919 INFO L225 Difference]: With dead ends: 379 [2022-07-23 06:08:59,919 INFO L226 Difference]: Without dead ends: 379 [2022-07-23 06:08:59,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=460, Invalid=1891, Unknown=1, NotChecked=0, Total=2352 [2022-07-23 06:08:59,920 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 277 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:08:59,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 527 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 397 Invalid, 0 Unknown, 243 Unchecked, 0.2s Time] [2022-07-23 06:08:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-23 06:08:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-07-23 06:08:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 340 states have (on average 1.1) internal successors, (374), 343 states have internal predecessors, (374), 0 states have call successors, (0), 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-07-23 06:08:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 374 transitions. [2022-07-23 06:08:59,924 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 374 transitions. Word has length 98 [2022-07-23 06:08:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:08:59,925 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 374 transitions. [2022-07-23 06:08:59,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 0 states have call successors, (0), 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-07-23 06:08:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 374 transitions. [2022-07-23 06:08:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 06:08:59,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:08:59,925 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:08:59,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:00,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:00,135 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1637321043, now seen corresponding path program 1 times [2022-07-23 06:09:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:00,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183965572] [2022-07-23 06:09:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:09:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:00,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183965572] [2022-07-23 06:09:00,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183965572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:00,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659977228] [2022-07-23 06:09:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:00,197 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:00,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-23 06:09:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:00,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:09:00,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:09:00,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:09:00,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659977228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:00,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:00,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-23 06:09:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729277558] [2022-07-23 06:09:00,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:00,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:09:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:09:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:09:00,600 INFO L87 Difference]: Start difference. First operand 344 states and 374 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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-07-23 06:09:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:00,654 INFO L93 Difference]: Finished difference Result 439 states and 465 transitions. [2022-07-23 06:09:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:09:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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 107 [2022-07-23 06:09:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:00,655 INFO L225 Difference]: With dead ends: 439 [2022-07-23 06:09:00,656 INFO L226 Difference]: Without dead ends: 439 [2022-07-23 06:09:00,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:09:00,656 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 344 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:00,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 204 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:09:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-23 06:09:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2022-07-23 06:09:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 423 states have (on average 1.099290780141844) internal successors, (465), 426 states have internal predecessors, (465), 0 states have call successors, (0), 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-07-23 06:09:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 465 transitions. [2022-07-23 06:09:00,661 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 465 transitions. Word has length 107 [2022-07-23 06:09:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 465 transitions. [2022-07-23 06:09:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 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-07-23 06:09:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 465 transitions. [2022-07-23 06:09:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-23 06:09:00,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:00,662 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-07-23 06:09:00,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:00,863 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash 141914171, now seen corresponding path program 3 times [2022-07-23 06:09:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548746388] [2022-07-23 06:09:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 152 proven. 201 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-23 06:09:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548746388] [2022-07-23 06:09:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548746388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599137362] [2022-07-23 06:09:01,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:09:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:01,039 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:01,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-23 06:09:01,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-23 06:09:01,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:01,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 06:09:01,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:09:01,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 06:09:01,213 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:01,213 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-07-23 06:09:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-23 06:09:01,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-23 06:09:01,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599137362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:01,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:01,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2022-07-23 06:09:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628725801] [2022-07-23 06:09:01,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:01,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:09:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:09:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:09:01,760 INFO L87 Difference]: Start difference. First operand 427 states and 465 transitions. Second operand has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 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-07-23 06:09:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:03,093 INFO L93 Difference]: Finished difference Result 609 states and 668 transitions. [2022-07-23 06:09:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-23 06:09:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 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) Word has length 118 [2022-07-23 06:09:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:03,097 INFO L225 Difference]: With dead ends: 609 [2022-07-23 06:09:03,097 INFO L226 Difference]: Without dead ends: 609 [2022-07-23 06:09:03,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=670, Invalid=2300, Unknown=0, NotChecked=0, Total=2970 [2022-07-23 06:09:03,098 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 272 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:03,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 342 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 495 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2022-07-23 06:09:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-07-23 06:09:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 426. [2022-07-23 06:09:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 423 states have (on average 1.0851063829787233) internal successors, (459), 425 states have internal predecessors, (459), 0 states have call successors, (0), 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-07-23 06:09:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 459 transitions. [2022-07-23 06:09:03,104 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 459 transitions. Word has length 118 [2022-07-23 06:09:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:03,104 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 459 transitions. [2022-07-23 06:09:03,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 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-07-23 06:09:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 459 transitions. [2022-07-23 06:09:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-23 06:09:03,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:03,104 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-07-23 06:09:03,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:03,334 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 104371967, now seen corresponding path program 2 times [2022-07-23 06:09:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:03,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735429604] [2022-07-23 06:09:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 159 proven. 194 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-23 06:09:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:03,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735429604] [2022-07-23 06:09:03,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735429604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:03,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13541046] [2022-07-23 06:09:03,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:09:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:03,523 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:03,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-23 06:09:03,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:09:03,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:03,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:09:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:03,776 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-07-23 06:09:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-23 06:09:03,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-23 06:09:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13541046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:04,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:04,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-07-23 06:09:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908905680] [2022-07-23 06:09:04,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:09:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:09:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:09:04,266 INFO L87 Difference]: Start difference. First operand 426 states and 459 transitions. Second operand has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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-07-23 06:09:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:04,734 INFO L93 Difference]: Finished difference Result 569 states and 615 transitions. [2022-07-23 06:09:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:09:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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 119 [2022-07-23 06:09:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:04,736 INFO L225 Difference]: With dead ends: 569 [2022-07-23 06:09:04,736 INFO L226 Difference]: Without dead ends: 569 [2022-07-23 06:09:04,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2022-07-23 06:09:04,737 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 134 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:04,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 245 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:09:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-23 06:09:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 413. [2022-07-23 06:09:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 1.072992700729927) internal successors, (441), 412 states have internal predecessors, (441), 0 states have call successors, (0), 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-07-23 06:09:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 441 transitions. [2022-07-23 06:09:04,744 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 441 transitions. Word has length 119 [2022-07-23 06:09:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:04,744 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 441 transitions. [2022-07-23 06:09:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 0 states have call successors, (0), 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-07-23 06:09:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 441 transitions. [2022-07-23 06:09:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-07-23 06:09:04,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:04,746 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:04,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:04,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-23 06:09:04,965 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:04,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1211272665, now seen corresponding path program 6 times [2022-07-23 06:09:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:04,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54929236] [2022-07-23 06:09:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 933 proven. 87 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2022-07-23 06:09:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:05,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54929236] [2022-07-23 06:09:05,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54929236] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:05,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744416217] [2022-07-23 06:09:05,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 06:09:05,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:05,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:05,190 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:05,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-23 06:09:05,667 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-23 06:09:05,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:05,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:09:05,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 1208 proven. 154 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-07-23 06:09:05,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 1240 proven. 122 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-07-23 06:09:06,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744416217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:06,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:06,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-07-23 06:09:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741818271] [2022-07-23 06:09:06,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:06,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:09:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:06,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:09:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:09:06,045 INFO L87 Difference]: Start difference. First operand 413 states and 441 transitions. Second operand has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 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-07-23 06:09:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:06,394 INFO L93 Difference]: Finished difference Result 450 states and 476 transitions. [2022-07-23 06:09:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:09:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 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 250 [2022-07-23 06:09:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:06,397 INFO L225 Difference]: With dead ends: 450 [2022-07-23 06:09:06,397 INFO L226 Difference]: Without dead ends: 450 [2022-07-23 06:09:06,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 488 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 06:09:06,399 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:06,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 329 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:09:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-07-23 06:09:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2022-07-23 06:09:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 403 states have (on average 1.0694789081885856) internal successors, (431), 404 states have internal predecessors, (431), 0 states have call successors, (0), 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-07-23 06:09:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 431 transitions. [2022-07-23 06:09:06,409 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 431 transitions. Word has length 250 [2022-07-23 06:09:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 431 transitions. [2022-07-23 06:09:06,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 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-07-23 06:09:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 431 transitions. [2022-07-23 06:09:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 06:09:06,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:06,411 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:06,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:06,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-23 06:09:06,633 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -981947701, now seen corresponding path program 7 times [2022-07-23 06:09:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:06,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636880145] [2022-07-23 06:09:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1409 proven. 305 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-23 06:09:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636880145] [2022-07-23 06:09:06,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636880145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132265674] [2022-07-23 06:09:06,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 06:09:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:06,881 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:06,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-23 06:09:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:07,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:09:07,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1455 proven. 259 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-23 06:09:07,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1455 proven. 259 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-07-23 06:09:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132265674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:07,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2022-07-23 06:09:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290564290] [2022-07-23 06:09:07,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:09:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:09:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:09:07,374 INFO L87 Difference]: Start difference. First operand 405 states and 431 transitions. Second operand has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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-07-23 06:09:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:07,623 INFO L93 Difference]: Finished difference Result 447 states and 473 transitions. [2022-07-23 06:09:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:09:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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 270 [2022-07-23 06:09:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:07,624 INFO L225 Difference]: With dead ends: 447 [2022-07-23 06:09:07,624 INFO L226 Difference]: Without dead ends: 447 [2022-07-23 06:09:07,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:09:07,625 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 116 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:07,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 530 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:09:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-23 06:09:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 429. [2022-07-23 06:09:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 1.0655737704918034) internal successors, (455), 428 states have internal predecessors, (455), 0 states have call successors, (0), 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-07-23 06:09:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 455 transitions. [2022-07-23 06:09:07,630 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 455 transitions. Word has length 270 [2022-07-23 06:09:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:07,631 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 455 transitions. [2022-07-23 06:09:07,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.380952380952381) internal successors, (155), 21 states have internal predecessors, (155), 0 states have call successors, (0), 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-07-23 06:09:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 455 transitions. [2022-07-23 06:09:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-23 06:09:07,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:07,632 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:07,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-23 06:09:07,852 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1423518731, now seen corresponding path program 8 times [2022-07-23 06:09:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:07,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597817161] [2022-07-23 06:09:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1361 proven. 150 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2022-07-23 06:09:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597817161] [2022-07-23 06:09:08,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597817161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885041642] [2022-07-23 06:09:08,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:09:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:08,084 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:08,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-23 06:09:08,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:09:08,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:09:08,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1865 proven. 269 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-23 06:09:08,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 1865 proven. 269 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-23 06:09:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885041642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:08,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:08,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-07-23 06:09:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559291068] [2022-07-23 06:09:08,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:08,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 06:09:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 06:09:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-07-23 06:09:08,923 INFO L87 Difference]: Start difference. First operand 429 states and 455 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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-07-23 06:09:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:09,707 INFO L93 Difference]: Finished difference Result 474 states and 500 transitions. [2022-07-23 06:09:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:09:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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 286 [2022-07-23 06:09:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:09,711 INFO L225 Difference]: With dead ends: 474 [2022-07-23 06:09:09,711 INFO L226 Difference]: Without dead ends: 474 [2022-07-23 06:09:09,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 562 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2022-07-23 06:09:09,712 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:09,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 732 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:09:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-23 06:09:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 454. [2022-07-23 06:09:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 452 states have (on average 1.0619469026548674) internal successors, (480), 453 states have internal predecessors, (480), 0 states have call successors, (0), 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-07-23 06:09:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 480 transitions. [2022-07-23 06:09:09,744 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 480 transitions. Word has length 286 [2022-07-23 06:09:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:09,744 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 480 transitions. [2022-07-23 06:09:09,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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-07-23 06:09:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 480 transitions. [2022-07-23 06:09:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-23 06:09:09,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:09,746 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:09,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:09,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:09,966 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash 589637946, now seen corresponding path program 9 times [2022-07-23 06:09:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:09,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589339703] [2022-07-23 06:09:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 1952 proven. 583 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2022-07-23 06:09:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589339703] [2022-07-23 06:09:10,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589339703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633191598] [2022-07-23 06:09:10,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:09:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:10,242 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:10,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-23 06:09:10,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 06:09:10,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:10,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:09:10,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 979 proven. 49 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2022-07-23 06:09:10,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3094 backedges. 979 proven. 49 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2022-07-23 06:09:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633191598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:10,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2022-07-23 06:09:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235180054] [2022-07-23 06:09:10,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:09:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:09:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-07-23 06:09:10,991 INFO L87 Difference]: Start difference. First operand 454 states and 480 transitions. Second operand has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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-07-23 06:09:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:12,357 INFO L93 Difference]: Finished difference Result 527 states and 556 transitions. [2022-07-23 06:09:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 06:09:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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 301 [2022-07-23 06:09:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:12,359 INFO L225 Difference]: With dead ends: 527 [2022-07-23 06:09:12,359 INFO L226 Difference]: Without dead ends: 527 [2022-07-23 06:09:12,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 586 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1131, Invalid=3425, Unknown=0, NotChecked=0, Total=4556 [2022-07-23 06:09:12,360 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 198 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:12,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 807 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 06:09:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-07-23 06:09:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 484. [2022-07-23 06:09:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 482 states have (on average 1.0601659751037344) internal successors, (511), 483 states have internal predecessors, (511), 0 states have call successors, (0), 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-07-23 06:09:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 511 transitions. [2022-07-23 06:09:12,364 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 511 transitions. Word has length 301 [2022-07-23 06:09:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:12,364 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 511 transitions. [2022-07-23 06:09:12,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 0 states have call successors, (0), 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-07-23 06:09:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 511 transitions. [2022-07-23 06:09:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-23 06:09:12,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:12,366 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:12,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:12,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-23 06:09:12,571 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2049426301, now seen corresponding path program 10 times [2022-07-23 06:09:12,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:12,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616704125] [2022-07-23 06:09:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 1780 proven. 228 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-07-23 06:09:12,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:12,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616704125] [2022-07-23 06:09:12,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616704125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:12,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682733010] [2022-07-23 06:09:12,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 06:09:12,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:12,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:12,831 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:12,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-23 06:09:23,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 06:09:23,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:23,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:09:23,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 2422 proven. 617 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-23 06:09:24,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3394 backedges. 2422 proven. 617 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-23 06:09:24,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682733010] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:24,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:24,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 29 [2022-07-23 06:09:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692301295] [2022-07-23 06:09:24,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:24,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:09:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:09:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-23 06:09:24,589 INFO L87 Difference]: Start difference. First operand 484 states and 511 transitions. Second operand has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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-07-23 06:09:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:25,406 INFO L93 Difference]: Finished difference Result 670 states and 705 transitions. [2022-07-23 06:09:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-23 06:09:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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 313 [2022-07-23 06:09:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:25,408 INFO L225 Difference]: With dead ends: 670 [2022-07-23 06:09:25,408 INFO L226 Difference]: Without dead ends: 670 [2022-07-23 06:09:25,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=893, Invalid=3397, Unknown=0, NotChecked=0, Total=4290 [2022-07-23 06:09:25,409 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 186 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:25,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 632 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:09:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-23 06:09:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 610. [2022-07-23 06:09:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 1.055921052631579) internal successors, (642), 609 states have internal predecessors, (642), 0 states have call successors, (0), 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-07-23 06:09:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 642 transitions. [2022-07-23 06:09:25,414 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 642 transitions. Word has length 313 [2022-07-23 06:09:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:25,415 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 642 transitions. [2022-07-23 06:09:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.310344827586206) internal successors, (270), 29 states have internal predecessors, (270), 0 states have call successors, (0), 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-07-23 06:09:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 642 transitions. [2022-07-23 06:09:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2022-07-23 06:09:25,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:25,418 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 25, 25, 25, 25, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:25,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-07-23 06:09:25,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-23 06:09:25,643 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2067975502, now seen corresponding path program 11 times [2022-07-23 06:09:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:25,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100202694] [2022-07-23 06:09:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2360 proven. 995 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-23 06:09:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:25,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100202694] [2022-07-23 06:09:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100202694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:25,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637288869] [2022-07-23 06:09:25,937 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 06:09:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:25,944 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:25,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-23 06:09:32,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-23 06:09:32,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:32,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:09:32,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2441 proven. 914 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-23 06:09:32,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 2460 proven. 895 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-23 06:09:32,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637288869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:32,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:32,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2022-07-23 06:09:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240180832] [2022-07-23 06:09:32,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:32,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:09:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:09:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:09:32,868 INFO L87 Difference]: Start difference. First operand 610 states and 642 transitions. Second operand has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 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-07-23 06:09:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:33,627 INFO L93 Difference]: Finished difference Result 638 states and 670 transitions. [2022-07-23 06:09:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:09:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 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 328 [2022-07-23 06:09:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:33,629 INFO L225 Difference]: With dead ends: 638 [2022-07-23 06:09:33,629 INFO L226 Difference]: Without dead ends: 638 [2022-07-23 06:09:33,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=570, Invalid=1980, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 06:09:33,631 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:33,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 477 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:09:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-07-23 06:09:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 626. [2022-07-23 06:09:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 624 states have (on average 1.0544871794871795) internal successors, (658), 625 states have internal predecessors, (658), 0 states have call successors, (0), 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-07-23 06:09:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 658 transitions. [2022-07-23 06:09:33,636 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 658 transitions. Word has length 328 [2022-07-23 06:09:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:33,637 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 658 transitions. [2022-07-23 06:09:33,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 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-07-23 06:09:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 658 transitions. [2022-07-23 06:09:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-07-23 06:09:33,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:33,640 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:33,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-23 06:09:33,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-23 06:09:33,851 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -425303788, now seen corresponding path program 12 times [2022-07-23 06:09:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:33,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194938873] [2022-07-23 06:09:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 1991 proven. 1568 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2022-07-23 06:09:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:34,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194938873] [2022-07-23 06:09:34,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194938873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:34,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514145753] [2022-07-23 06:09:34,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 06:09:34,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:34,154 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:34,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-23 06:09:38,196 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-23 06:09:38,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:09:38,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:09:38,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 2080 proven. 474 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2022-07-23 06:09:38,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 2106 proven. 448 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2022-07-23 06:09:38,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514145753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:09:38,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:09:38,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-07-23 06:09:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822161421] [2022-07-23 06:09:38,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:09:38,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 06:09:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:09:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 06:09:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1681, Unknown=0, NotChecked=0, Total=1980 [2022-07-23 06:09:38,988 INFO L87 Difference]: Start difference. First operand 626 states and 658 transitions. Second operand has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 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-07-23 06:09:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:09:40,851 INFO L93 Difference]: Finished difference Result 886 states and 930 transitions. [2022-07-23 06:09:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-23 06:09:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 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 336 [2022-07-23 06:09:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:09:40,854 INFO L225 Difference]: With dead ends: 886 [2022-07-23 06:09:40,854 INFO L226 Difference]: Without dead ends: 886 [2022-07-23 06:09:40,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 644 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2486, Invalid=8226, Unknown=0, NotChecked=0, Total=10712 [2022-07-23 06:09:40,856 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:09:40,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 689 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:09:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-23 06:09:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 784. [2022-07-23 06:09:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 782 states have (on average 1.0537084398976981) internal successors, (824), 783 states have internal predecessors, (824), 0 states have call successors, (0), 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-07-23 06:09:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 824 transitions. [2022-07-23 06:09:40,863 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 824 transitions. Word has length 336 [2022-07-23 06:09:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:09:40,864 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 824 transitions. [2022-07-23 06:09:40,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.8) internal successors, (306), 45 states have internal predecessors, (306), 0 states have call successors, (0), 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-07-23 06:09:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 824 transitions. [2022-07-23 06:09:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-23 06:09:40,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:09:40,866 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 2, 1, 1, 1] [2022-07-23 06:09:40,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-07-23 06:09:41,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-23 06:09:41,081 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 06:09:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:09:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -297117737, now seen corresponding path program 13 times [2022-07-23 06:09:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:09:41,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92566230] [2022-07-23 06:09:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:09:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:09:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2022-07-23 06:09:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:09:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92566230] [2022-07-23 06:09:41,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92566230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:09:41,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288631403] [2022-07-23 06:09:41,980 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 06:09:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:09:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:09:41,982 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:09:41,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-23 06:09:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:09:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-23 06:09:42,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:09:42,345 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-07-23 06:09:42,350 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-07-23 06:09:42,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:09:42,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:09:42,389 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:42,390 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-07-23 06:09:42,473 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:42,474 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-07-23 06:09:42,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:09:42,651 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:09:42,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:09:42,662 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:42,663 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-07-23 06:09:42,814 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:42,815 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-07-23 06:09:42,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:09:43,001 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:43,002 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-07-23 06:09:43,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:09:43,234 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:09:43,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:09:43,256 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:43,256 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-07-23 06:09:43,602 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:09:43,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:09:43,611 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:43,611 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-07-23 06:09:43,901 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:09:43,901 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-07-23 06:09:43,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:09:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 0 proven. 3584 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2022-07-23 06:09:44,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:09:54,479 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:09:54,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:09:54,509 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 43 treesize of output 61 [2022-07-23 06:09:57,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:09:57,478 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 43 treesize of output 61 [2022-07-23 06:10:02,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:10:02,156 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 43 treesize of output 61 [2022-07-23 06:10:09,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:10:09,638 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 49 treesize of output 67 [2022-07-23 06:10:14,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:10:14,441 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 49 treesize of output 67